【leetcode】Search Rotated Sorted Array

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.

 1 class Solution {
 2 public:
 3     int search(vector<int>& nums, int target) {
 4         //if(nums.size()==0) return ;
 5 
 6         for(int i=0;i<nums.size();i++)
 7         {
 8             if(target==nums[i])
 9                 return i;
10         }
11 
12         return -1;
13     }
14 };

【leetcode】Search Rotated Sorted Array

原文：http://www.cnblogs.com/jawiezhu/p/4496024.html