3.11 程序改错
这题考察了读者对各种二分查找的的掌握程度,并且还有编码的正确性。
二分查找的原理看似简单,但是如果边界条件没有处理好,极易出现死循环或者得不到正确的答案。
下面总结了编程之美上要求的5种二分查找的代码写法,其中肯定有没有想到的情况,望网友留言指正
1、给定一个有序(不降序)数组arr,求任意一个i,使得arr[i]等于v,不存在则返回-1
int AnyEqual(int* arr, int b, int e, int v)
{
int left = b;
int right = e;
int mid;
while (left <= right)
{
mid = left + (right - left) / 2;
if (arr[mid] == v)
return mid;
else if (arr[mid] < v)
left = mid + 1;
else
right = mid - 1;
}
return -1;
}
2、给定一个有序(不降序)数组arr,求最小的i,使得arr[i]等于v,不存在则返回-1
int MinEqual(int* arr, int b, int e, int v)
{
int left = b;
int right = e;
int mid;
while (left <= right)
{
mid = left + (right - left) / 2;
if (arr[mid] < v)
left = mid + 1;
else
right = mid - 1;
}
if (arr[right+1] == v)
return right + 1;
else
return -1;
}
3、给定一个有序(不降序)数组arr,求最大的i,使得arr[i]等于v,不存在则返回-1
int MaxEqual(int* arr, int b, int e, int v)
{
int left = b;
int right = e;
int mid;
while (left <= right)
{
mid = left + (right - left) / 2;
if (arr[mid] <= v)
left = mid + 1;
else
right = mid - 1;
}
if (arr[left] == v)
return left;
else
return -1;
}
4、给定一个有序(不降序)数组arr,求最大的i,使得arr[i]小于v,不存在则返回-1
int MaxLessThan(int* arr, int b, int e, int v)
{
int left = b;
int right = e;
int mid;
while (left <= right)
{
mid = left + (right - left) / 2;
if (arr[mid] < v)
left = mid + 1;
else
right = mid - 1;
}
if (arr[right] >= v)
return -1;
else
return right;
}
5、给定一个有序(不降序)数组arr,求最小的i,使得arr[i]大于v,不存在则返回-1
int MinMoreThan(int* arr, int b, int e, int v)
{
int left = b;
int right = e;
int mid;
while (left <= right)
{
mid = left + (right - left) / 2;
if (arr[mid] <= v)
left = mid + 1;
else
right = mid - 1;
}
if (arr[left] <= v)
return -1;
else
return left;
}