leetcode解题方案--154--Find Minimum in Rotated Sorted Array II

最新推荐文章于 2022-05-26 16:47:57 发布

笔筒谜语

最新推荐文章于 2022-05-26 16:47:57 发布

阅读量115

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/sinat_16014143/article/details/78704975

版权

leetcode 专栏收录该内容

85 篇文章 0 订阅

订阅专栏

题目

Follow up for “Find Minimum in Rotated Sorted Array”:
What if duplicates are allowed?

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

分析

题目改成了可能会重复，经典测试例是【1，1，1，10，10】
所以要考虑相等的情况。如果遇到相等，就–

class Solution {
    public static int findMin(int[] nums) {
        int low = 0;
        int high = nums.length-1;
        if (nums[high] > nums[low]) {
            return nums[low];
        }
        while (high - low >1) {
            int mid = (high + low)/2;
            if (nums[mid] < nums[high]) {
                high = mid;
            } else if (nums[mid] > nums[high]){
                low = mid;
            } else {
                high--;
            }
        }
        return nums[high];
    }
}