二分查找及各种变体实现
2021/11/18 6:11:52
本文主要是介绍二分查找及各种变体实现,对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!
public class BinarySearch { // 二分查找 public static int bSearch(int[] nums, int target) { int n = nums.length; int low = 0; int high = n - 1; while (low <= high) { int mid = low + ((high - low) >> 1); if (nums[mid] > target) { high = mid - 1; } else if (nums[mid] < target) { low = mid + 1; } else { return mid; } } return -1; } // 查找第一个值等于给定值的元素 public static int searchFirstTarget(int[] nums, int target) { int n = nums.length; int low = 0; int high = n - 1; while (low <= high) { int mid = low + ((high - low) >> 1); if (nums[mid] > target) { high = mid - 1; } else if (nums[mid] < target) { low = mid + 1; } else { if (mid == 0 || nums[mid - 1] != target) { return mid; } else { high = mid - 1; } } } return -1; } // 查找最后一个值等于给定值的元素 public static int searchLastTarget(int[] nums, int target) { int n = nums.length; int low = 0; int high = n - 1; while (low <= high) { int mid = low + ((high - low) >> 1); if (nums[mid] > target) { high = mid - 1; } else if (nums[mid] < target) { low = mid + 1; } else { if (mid == n - 1 || nums[mid + 1] != target) { return mid; } else { low = mid + 1; } } } return -1; } // 查找第一个大于等于给定值的元素 public static int searchFirstGreaterOrEqual2Target(int[] nums, int target) { int n = nums.length; int low = 0; int high = n - 1; while (low <= high) { int mid = low + ((high - low) >> 1); if (nums[mid] >= target) { if (mid == 0 || nums[mid - 1] < target) { return mid; } else { high = mid - 1; } } else { low = mid + 1; } } return -1; } // 查找第一个小于等于给定值的元素 public static int searchLastLessOrEqual2Target(int[] nums, int target) { int n = nums.length; int low = 0; int high = n - 1; while (low <= high) { int mid = low + ((high - low) >> 1); if (nums[mid] <= target) { if (mid == n - 1 || nums[mid + 1] > target) { return mid; } else { low = mid + 1; } } else { high = mid - 1; } } return -1; } // 查找元素的第一个和最后一个位置 public static int[] searchRange(int[] nums, int target) { int n = nums.length; int low = 0; int high = n - 1; int[] ans = new int[]{-1, -1}; while (low <= high) { int mid = low + ((high - low) >> 1); if (nums[mid] < target) { low = mid + 1; } else if (nums[mid] > target) { high = mid - 1; } else { int start = mid; int end = mid; while (start >= 0 && nums[start] == target) { start--; } while (end <= n - 1 && nums[end] == target) { end++; } ans[0] = start + 1; ans[1] = end - 1; return ans; } } return ans; } }
这篇关于二分查找及各种变体实现的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!
- 2024-07-02springboot项目无法注册到nacos-icode9专业技术文章分享
- 2024-06-26结对编程到底难不难?答案在这里
- 2024-06-19《2023版Java工程师》课程升级公告
- 2024-06-15matplotlib作图不显示3D图,怎么办?
- 2024-06-1503-Loki 日志监控
- 2024-06-1504-让LLM理解知识 -Prompt
- 2024-06-05做软件测试需要懂代码吗?
- 2024-06-0514-ShardingSphere的分布式主键实现
- 2024-06-03为什么以及如何要进行架构设计权衡?
- 2024-05-31全网首发第二弹!软考2024年5月《软件设计师》真题+解析+答案!(11-20题)