81. Search in Rotated Sorted Array II 解题记录

题目描述：

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).

Write a function to determine if a given target is in the array.

The array may contain duplicates.

解题思路：

还是一个个遍历过去。。。

代码：

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