首页 > 代码库 > Find Minimum in Rotated Sorted Array II
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.
答案
public class Solution {
int []num;
public int findMin(int start,int end)
{
if(start==end)
{
return num[start];
}
if(num[start]==num[end])
{
return findMin(start+1,end);
}
int middle=start+((end-start)>>1);
if(num[middle]>num[end])
{
return findMin(middle+1,end);
}
return findMin(start,middle);
}
public int findMin(int[] num) {
this.num=num;
return findMin(0,num.length-1);
}
}Find Minimum in Rotated Sorted Array II
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。