7.1号更新
思路
二分查找
class Solution {
public:
int minArray(vector<int>& numbers) {
int index1 = 0;//左指针
int index2 = numbers.size() - 1;//右指针
int midIndex = index1;//中间位置
while (numbers[index1]>=numbers[index2])
{
if (index2 - index1 == 1) {//索引相邻,说明index2即为最小值
midIndex = index2;
break;
}
midIndex = index1 + (index2 - index1) / 2;
//当index1和index2和midIndex相等,需要顺序查找
if (numbers[index1] == numbers[index2] && numbers[midIndex] == numbers[index1]) {
int result = numbers[index1];
for (int i = index1 + 1; i <= index2; ++i) {
if (result > numbers[i]) result = numbers[i];//找最小值
}
return result;
}
if (numbers[midIndex] >= numbers[index1]) index1 = midIndex;//中间值比左边大,说明在左侧的递增子区间中
else if(numbers[midIndex]<=numbers[index2])index2 = midIndex;//中间值比右边小,说明在右侧的递增子区间中
}
return numbers[midIndex];
}
};
解题思路
看二分的解析头炸了,就采用传统的循环方法,感觉效果也不错
在另一道154.寻找旋转排序数组中的最小值中
执行耗时如下:
代码
class Solution {
public:
int minArray(vector<int>& numbers) {
if (numbers.empty()) return 0;//特判
int min = numbers[0];
for (int i=1;i<numbers.size();i++)
{
if (min > numbers[i]) return numbers[i];
}
return min;
}
};