81. Search in Rotated Sorted Array II

最新推荐文章于 2023-11-12 22:36:10 发布

其实系一个须刨

最新推荐文章于 2023-11-12 22:36:10 发布

阅读量59

点赞数

分类专栏： LEETCODE

本文链接：https://blog.csdn.net/lianggx3/article/details/90327512

版权

LEETCODE 专栏收录该内容

144 篇文章 1 订阅

订阅专栏

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 1:

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

Example 2:

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

与Search in Rotated Sorted Array I一致，有特殊情况，就是当nums[left]==nums[right]的时候，不知道target会落在左边还是右边，所以把数组切割一下，递归判断左边与右边是否能找到。

class Solution {
    public boolean search(int[] nums, int target) {
        int left = 0;
        int right = nums.length - 1;
        if (nums.length == 0)
            return false;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (nums[mid] == target)
                return true;
            if (nums[left] > nums[right]){
                if (target >= nums[left]) {
                    if (nums[mid] >= nums[left] && nums[mid] < target)
                        left = mid + 1;
                    else right = mid - 1;
                } else {
                    if (nums[mid] > target && nums[mid] <= nums[right])
                        right = mid - 1;
                    else
                        left = mid + 1;
                }
            }
            else if (nums[left] < nums[right]) {
                if (nums[mid] < target)
                    left = mid + 1;
                else
                    right = mid - 1;
            } 
            else if (nums[left] == nums[right]) {
                if (target == nums[left])
                    return true;
                return (search(Arrays.copyOfRange(nums, left, mid),target) || search(Arrays.copyOfRange(nums, mid + 1, right+1),target)) ;
            }
        }
        return  false;
    }
}

方法二：

摘自https://blog.csdn.net/happyaaaaaaaaaaa/article/details/51602234

当 nums[mid] = nums[left] 时，这时由于很难判断 target 会落在哪，那么只能采取 left++

当 nums[mid] > nums[left] 时，这时可以分为两种情况，判断左半部比较简单

当 nums[mid] < nums[left] 时，这时可以分为两种情况，判断右半部比较简单

public class Solution {
    public boolean search(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (target == nums[mid]) return true;
            if (nums[mid] == nums[left]) left++;
            else if (nums[mid] > nums[left]) {
                if (nums[left] <= target && nums[mid] > target) right = mid - 1;
                else left = mid + 1;
            } else {
                if (nums[mid] < target && target <= nums[right]) left = mid + 1;
                else right = mid - 1;
            }
        }
        return false;
    }
}