力扣-33 搜索旋轉排序數組

Idea

1. 暴力搜索
   2.二分搜索

AC Code

class Solution {
public:int search(vector<int>& nums, int target) {int n = nums.size();int l = 0,r = n-1;while(l<=r){int mid = l+(r-l)/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;}
};