leetcode81. Search in Rotated Sorted Array II

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.

解法

因为最坏情况下是O(n)，相当于一个for循环，而且有重复的元素不能判断是在数组左半部分还是右半部分。

public class Solution {    public boolean search(int[] nums, int target) {        if (nums == null || nums.length == 0) {            return false;        }        for (int i = 0; i < nums.length; i++) {            if (nums[i] == target) {                return true;            }        }        return false;    }}