有序数组
- 查找值等于给定值的元素(无重复元素)
- 查找给定元素的第一个位置(有重复元素)
- 查找给定元素的最后一个位置(有重复元素)
- 查找第一个大于等于给定值的元素(有重复)
- 查找最后一个小于等于等于给定值的元素(有重复)
1 查找第一个值等于给定值的元素(无重复元素)
public int search(int[] nums, int target) {
int left = 0, right = nums.length - 1;
//当搜索区间为空时,跳出循环(left>right)
while(left <= right) {//等于的时候是left=right=mid的时候,这时候仍然继续
int mid = left + (right - left) / 2;
if(nums[mid] == target) {
return mid;
}
else if(nums[mid] < target) {
left = mid + 1;
}
else if(nums[mid] > target) {
right = mid - 1;
}
}
return -1;
}
2 查找给定元素的第一个位置
public int bsearch(int[] a, int n, int value) {
int low = 0;
int high = n - 1;
while (low <= high) {
int mid = low + ((high - low) >> 1);
if (a[mid] > value) {
high = mid - 1;
} else if (a[mid] < value) {
low = mid + 1;
} else {
if ((mid == 0) || (a[mid - 1] != value)) return mid;
else high = mid - 1;
}
}
return -1;
}
3 在排序数组中查找元素的最后一个位置
public int bsearch(int[] a, int n, int value) {
int low = 0;
int high = n - 1;
while (low <= high) {
int mid = low + ((high - low) >> 1);
if (a[mid] > value) {
high = mid - 1;
} else if (a[mid] < value) {
low = mid + 1;
} else {
if ((mid == n - 1) || (a[mid + 1] != value)) return mid;
else low = mid + 1;
}
}
return -1;
}
4 在有重复元素的有序数组中查找第一个大于等于给定值的元素
(12456)查找第一个比3 大的数,即4
public int bsearch(int[] a, int n, int value) {
int low = 0;
int high = n - 1;
while (low <= high) {
int mid = low + ((high - low) >> 1);
if(a[mid] < target){
low = mid + 1;
}
else if (a[mid] >= value) {
if ((mid == 0) || (a[mid - 1] < value)) return mid;
else high = mid - 1;
}
}
return -1;
}
5 在有重复元素的有序数组中查找最后一个小于等于给定值的元素
(12456)查找最后一个比3 小的数,即2
public int bsearch7(int[] a, int n, int value) {
int low = 0;
int high = n - 1;
while (low <= high) {
int mid = low + ((high - low) >> 1);
if (a[mid] > value) {
high = mid - 1;
}
else if(a[mid] <= target){
if ((mid == n - 1) || (a[mid + 1] > value)) return mid;
else low = mid + 1;
}
}
return -1;
}