33. Search in Rotated Sorted Array【leetcode解题报告】

Description

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).

Example 1:

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

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

思路

二分法。
1. 比较A[mid]与target是否相等
- A[mid]==target：返回mid
- A[mid]>target or mid

代码

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int n=nums.size();
        if(n==0){
            return -1;
        }
        int left=0,right=n-1;
        while(left<=right){
            int mid=(left+right)/2;
            if(nums[mid] == target){
                return mid;
            }
            if(nums[mid]>target){
                if(nums[mid]>nums[right] && nums[right]>=target){
                    left = mid+1;
                }else{
                    right = mid-1;
                }
            }else{
                if(nums[mid]<nums[left] && nums[left]<=target){
                    right=mid-1;
                }else{
                    left = mid+1;
                }
            }
        }
        return -1;
    }
};

难度进阶：https://blog.csdn.net/tan_change/article/details/80150477

Tag：阿里妈妈18暑期实习面试题