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 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.
解决：
① 本题与I的区别在于翻转数组中可能会存在重复。我们只需要添加一个条件，它检查最左边的元素和最右边的元素是否相等。 如果是的话，我们可以简单地放下其中一个。使用递归方法进行处理。
class Solution{ //1ms
public static int findMin(int[] nums){
return helper(nums,0,nums.length - 1);
}
public static int helper(int[] nums,int left,int right){
if (left == right){
return nums[left];
}
if (nums[left] >= nums[right]){
while(left + 1 < right){
int mid = (right - left) / 2 + left;
if (nums[left] == nums[right]){
return helper(nums,left,right - 1);
}else if (nums[mid] >= nums[left] || (nums[mid] < nums[left] && nums[mid] > nums[right])){
return helper(nums,mid,right);
}else if(nums[mid] < nums[left] && nums[mid] <= nums[right]){
return helper(nums,left,mid);
}
}
return Math.min(nums[left],nums[right]);
}
return nums[left];
}
}
② 使用迭代方法。
class Solution{//1ms
public static int findMin(int[] nums) {
int left = 0;
int right = nums.length - 1;
while(left + 1 < right){
int mid = (right - left) / 2 + left;
while (nums[left] == nums[right] && left != right){
right --;
}
if (nums[left] < nums[right]){
return nums[left];
}
if (nums[left] <= nums[mid] || (nums[left] > nums[mid] && nums[mid] > nums[right])){
left = mid;
}else{
right = mid;
}
}
return Math.min(nums[left],nums[right]);
}
}
③ 直接遍历
class Solution {//1ms
public int findMin(int[] nums) {
int min = Integer.MAX_VALUE;
for(int i = 0; i < nums.length; i++){
if(nums[i] < min)
min = nums[i];
}
return min;
}
}
扫一扫
364
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
