Leetcode 81. Search in Rotated Sorted Array II (Medium) (java)

来源：互联网发布：d h算法编辑：程序博客网时间：2024/04/30 16:25

Tag: Array, Binary Search

Difficulty: Medium

/*81. Search in Rotated Sorted Array II (Medium)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.*/public class Solution {    public boolean search(int[] nums, int target) {        if (nums == null || nums.length == 0) {            return false;        }        int l = 0, r = nums.length - 1;        while (l <= r) {            int mid = l + (r - l) / 2;            if (nums[mid] == target) {                return true;            } else if (nums[l] < nums[mid]) {                if (nums[l] <= target && target < nums[mid]) {                    r = mid - 1;                } else {                    l = mid + 1;                }            } else if (nums[mid] < nums[l]) {                if (target <= nums[r] && nums[mid] < target) {                    l = mid + 1;                } else {                    r = mid - 1;                }              }  else {                l++;            }        }        return false;    }}

0 0