LeetCode 081 Search in Rotated Sorted Array II

题目描述

Follow up for “Search in Rotated Sorted Array”:

What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

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

代码

[code]    public boolean search(int[] nums, int target) {

        int left = 0, right = nums.length - 1;

        while (left <= right) {

            int mid = (left + right) / 2;

            if (nums[mid] == target)
                return true;

            if (nums[left] < nums[mid]) {
                if (target <= nums[mid] && target >= nums[left])
                    right = mid - 1;
                else
                    left = mid + 1;
            } else if (nums[left] > nums[mid]) {
                if (target >= nums[left] || target <= nums[mid])
                    right = mid - 1;
                else
                    left = mid + 1;
            } else
                left++;
        }

        return false;
    }