description:

一個數列，不知道在哪翻轉了一下，現在給定一個值，如果他在這個翻轉后的數列里， return 它對應的 index
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).

You are given a target value to search. If found in the array return its index, otherwise return -1.

You may assume no duplicate exists in the array.

Your algorithm's runtime complexity must be in the order of O(log n).
Note:

Example:

Example 1:Input: nums = [4,5,6,7,0,1,2], target = 0 Output: 4Example 2:Input: nums = [4,5,6,7,0,1,2], target = 3 Output: -1

answer:

class Solution { public:int search(vector<int>& nums, int target) {int left = 0, right = nums.size() - 1;while (left <= right) {int mid = left + (right - left) / 2;if (nums[mid] == target) return mid;if (nums[mid] < nums[right]) {//較之于普通的二分查找，增加了中軸值得判斷if (nums[mid] < target && nums[right] >= target) left = mid + 1;else right = mid - 1;} else {if (nums[mid] > target && nums[left] <= target) right = mid - 1;else left = mid + 1;}}return -1;} };

relative point get√：

hint :

轉載于:https://www.cnblogs.com/forPrometheus-jun/p/11095370.html

與50位技術專家面對面20年技術見證，附贈技術全景圖

總結

以上是生活随笔為你收集整理的33. Search in Rotated Sorted Array的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。