81. Search in Rotated Sorted Array II

problem:

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) {        if(nums.empty())            return false;        for(int i=0; i<nums.size(); i++)            if(nums[i] == target)                return true;        return false;    }};