标签：style blog color io os ar java for strong
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
标签：style blog color io os ar java for strong
原文地址：http://blog.csdn.net/jiewuyou/article/details/40371089
