[leetcode Q33] Search in Rotated Sorted Array

1. 问题

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.

2. 思路

我使用线性查找的代码也通过了，但题目似乎是想要得到二分查找的解决方案，有空再来补充使用二分查找的解决方案。

3. 实现

class Solution {public:    int search(vector<int>& nums, int target) {        int i;        for (i = 0; i < nums.size(); i++)            if (nums[i] == target)                return i;        return -1;    }};