[leetcode]-33. Search in Rotated Sorted Array（C语言）

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

int search(int* nums, int numsSize, int target) {
    if(numsSize==0)
        return -1;
    if(numsSize==1)
    {
        if(nums[0]==target)
            return 0;
        else
            return -1;
    }
    int i,j,k,l=0;
    int left=0,right;
    for(i=1;i<numsSize;i++)
    {
        if(nums[i]<nums[i-1])
        {
            right=i-1;
            l=1;
            break;
        }
    }
    if(l==0)
        right=numsSize-1;
    if(!(nums[left]>target||nums[right]<target))
    {
        while(left<=right)
        {
            int mid=left+(right-left)/2;
            if(nums[mid]==target)
                return mid;
            else if(nums[mid]>target)
                right=mid-1;
            else
                left=mid+1;
        }
    }
    left=i;
    right=numsSize-1;
    if(nums[left]>target||nums[right]<target)
        return -1;
    while(left<=right)
    {
        int mid=left+(right-left)/2;
        if(nums[mid]==target)
            return mid;
        else if(nums[mid]>target)
            right=mid-1;
        else
            left=mid+1;
    }
    return -1;
}