[leetcode-33]Search in Rotated Sorted Array(C)

问题描述:
Suppose a sorted array 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.

分析：这个题确定没有bug？？？

代码如下：0ms

int search(int* nums, int numsSize, int target) {
    int i;
    for(i = 0;i<numsSize;i++){
        if(nums[i]==target)
            break;
    }
    if(i>=numsSize)
        return -1;

    return i;
}