LeetCode Find Minimum in Rotated Sorted Array II

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 a sorted array 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.

题意：给出一个数组，可能经过旋转的，并且数组中包含重复的元素。求其最小值

思路：用二分法。（1）如果a[mid] < a[right],说明最小值是在[left, mid]之间。（2）如果a[mid] > a[right],说明最小值在[mid+1,right]之间.(3)如果a[mid] = a[right],说明最小值在[left, right-1]之间

代码如下：

class Solution {public int findMin(int[] nums){int left = 0, right = nums.length - 1;while (left < right){int mid = (left + right) >> 1;if (nums[mid] > nums[right]) left = mid + 1;else if (nums[mid] < nums[right]){right = mid;}else{right--;}}return nums[left];}
}

LeetCode Find Minimum in Rotated Sorted Array II相关推荐

LeetCode——Find Minimum in Rotated Sorted Array II
Question Follow up for "Find Minimum in Rotated Sorted Array": What if duplicates are allo ...
【LeetCode】154. Find Minimum in Rotated Sorted Array II (3 solutions)
Find Minimum in Rotated Sorted Array II Follow up for "Find Minimum in Rotated Sorted Array&quo ...
LeetCode Find Minimum in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 migh ...
Find Minimum in Rotated Sorted Array II
Description: Follow up for "Find Minimum in Rotated Sorted Array": What if duplicates are ...
【leetcode】Search in Rotated Sorted Array II（middle）☆
Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this ...
leetcode 81 Search in Rotated Sorted Array II ----- java
Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this ...
[LeetCode]Find Minimum in Rotated Sorted Array
题目描述: Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 ...
[LeetCode] 81. Search in Rotated Sorted Array II
题目: Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. ( ...
154. Find Minimum in Rotated Sorted Array II
文章目录题目理解二分+分治只有二分 154是 153的升级版本. 题目理解输入:一个按升序排序的数组nums,但是这个数组在某个位置被旋转了.(例如., 原始数组是[0,1,2,4,5,6,7 ...

LeetCode Find Minimum in Rotated Sorted Array II

LeetCode Find Minimum in Rotated Sorted Array II相关推荐

最新文章

热门文章