第七周：33. Search in Rotated Sorted Array

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.

Subscribe to see which companies asked this question.

解题思路：数组从头到尾遍历查找，找到返回对应下标。

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