Search in Rotated Sorted Array

 1 int Solution::search(const vector<int>& nums, int target) 
 2 {
 3     // 解题思路：当nums[mid] > nums[last-1]时，
 4     // [first,mid]有序，[mid,last)无序，
 5     // 否则[first,mid]无序,[mid,last)有序，
 6     // 因为当 nums[mid] > target 时，target 可能在mid的左边或者右边,
 7     // 所以还要将target 与 nums[first]对比
 8     int first = 0, last = nums.size();
 9     while(first != last) 
10     {
11         const int mid = first + (last - first) / 2;
12         if(nums[mid] == target)
13             return mid;
14         if(nums[mid] > nums[last-1])
15         {
16             if(nums[mid] > target && target >= nums[first])
17                 last = mid;
18             else
19                 first = mid + 1;
20         } else
21         {
22             if(nums[mid] < target && target <= nums[last-1]) 
23                 first = mid + 1;
24             else
25                 last = mid;
26         }
27     }
28     return -1;
29 }