[LeetCode] Problem 81 - Search in Rotated Sorted Array II

Posted on | In ,

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., [0,0,1,2,2,5,6] might become [2,5,6,0,0,1,2]).

You are given a target value to search. If found in the array return true, otherwise return false.

Example

No.1

Input: nums = [2,5,6,0,0,1,2], target = 0

Output: true

No.2

Input: nums = [2,5,6,0,0,1,2], target = 3

Output: false

Follow up

This is a follow up problem to Search in Rotated Sorted Array, where nums may contain duplicates.
Would this affect the run-time complexity? How and why?

Code

1
2
3
4
5
6
7
8
9
// [1,1,1,1... 1]里有一个0
public boolean search(int[] nums, int target) {
    for (int i = 0; i < nums.length; i++) {
        if (target == nums[i])
            return true;
    }

    return false;
}