Find Minimum in Rotated Sorted Array

题目：

Supposeasortedarrayisrotatedatsomepivotunknowntoyoubeforehand.

(i.e.,

0124567

mightbecome

4567012

).

Findtheminimumelement.

Youmayassumenoduplicateexistsinthearray.

代码：九章算法的模板

publicclassSolution{
publicintfindMin(int[]nums)
{
intstart=0;
intend=nums.length-1;

while(start+1<end)
{
intmid=start+(end-start)/2;
if(nums[mid]>=nums[end])start=mid;
elseend=mid;
}

if(nums[start]>=nums[end])returnnums[end];
elsereturnnums[start];

}
}