LeetCode No.154 Find Minimum in Rotated Sorted Array II

最新推荐文章于 2024-09-16 06:54:08 发布

彰彰大人

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量185

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/u010771356/article/details/63291792

版权

LeetCode 专栏收录该内容

2 篇文章 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?
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

Find the minimum element.

The array may contain duplicates. 即元素可重复
*/

public class Solution {
   public int findMin(int[] nums) {
      int l = 0, r = nums.length-1;
      while (l < r) {
          int mid = (l + r) / 2;
              if (nums[mid] < nums[r]) {
                     r = mid;
              } else if (nums[mid] > nums[r]){
                     l = mid + 1;
              } else {  
                r--;  //nums[mid]=nums[r] no idea, but we can eliminate nums[r];
          }
     }
     return nums[l];
   }
}