题目:
分析:当我们将数组旋转的时候,就无法再保证数组是完全有序的了,但是我们可以判断出那块是有序的。然后在进行比较和查找
如下代码:
class Solution {
public:
int search(vector<int>& nums, int target) {
int n = (int)nums.size();
if (!n) {
return -1;
}
if (n == 1) {
return nums[0] == target ? 0 : -1;
}
int l = 0, r = n - 1;
while (l <= r) {
int mid = (l + r) / 2;
if (nums[mid] == target) return mid;
if (nums[0] <= nums[mid]) {
if (nums[0] <= target && target < nums[mid]) {
r = mid - 1;
} else {
l = mid + 1;
}
} else {
if (nums[mid] < target && target <= nums[n - 1]) {
l = mid + 1;
} else {
r = mid - 1;
}
}
}
return -1;
}
};
对于已经是有序的数组,比如是升序排序的数组,可以直接使用二分查找算法。
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
int searchInsert(vector<int>& nums, int target)
{
int left = 0,right = nums.size()-1;//设定初始位置
int mid = 0;
while(left<=right)//只要左值没有超过右值,一直循环
{
mid = left+(right-left)/2;
if(nums[mid]<target)
{
left = mid+1;//关键语句
}
else
{
right = mid-1;//关键语句
}
}
return left;
}
};
int main()
{
Solution way;
vector<int>nums={1,2,3,4,5,6};
cout <<way.searchInsert(nums,2)<<"it is over"<<endl;
return 0;
}