LeetCode------Search in Rotated Sorted Array II

最新推荐文章于 2024-05-03 20:14:24 发布

zhumqs

最新推荐文章于 2024-05-03 20:14:24 发布

阅读量180

点赞数

分类专栏： LeetCode 文章标签： LeetCode search in rolated sorted array

本文链接：https://blog.csdn.net/DjokerMax/article/details/82424593

版权

LeetCode 专栏收录该内容

50 篇文章 0 订阅

订阅专栏

这里写图片描述

package com.zhumq.lianxi;

public class SearchinRotatedSortedArrayII {
    // Search in Rotated Sorted Array II
    // Time Complexity: O(n)，Space Complexity: O(1)
    public boolean search(int[] nums, int target) {
        int first = 0, last = nums.length;
        while (first != last) {
            final int mid = first  + (last - first) / 2;
            if (nums[mid] == target)
                return true;
            if (nums[first] < nums[mid]) {
                if (nums[first] <= target && target < nums[mid])
                    last = mid;
                else
                    first = mid + 1;
            } else if (nums[first] > nums[mid]) {
                if (nums[mid] < target && target <= nums[last-1])
                    first = mid + 1;
                else
                    last = mid;
            } else
                //只多出来这一步，当最左边值等于中间值时就从最左边往右走一步接着判断
                first++;
        }
        return false;
    }
}