标签：
题目：
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.
You may assume no duplicate exists in the array.
代码：
1 public class Solution { 2 public int findMin(int[] nums) 3 { 4 int len=nums.length; 5 int left=0; 6 int right=len-1; 7 8 while(left<right) 9 { 10 int mid=(left+right)/2; 11 if(nums[mid]>nums[right]) 12 { 13 left=mid+1; 14 } 15 else 16 { 17 right=mid; 18 } 19 20 } 21 22 return nums[left]; 23 24 } 25 }
Find Minimum in Rotated Sorted Array
标签：
原文地址：http://www.cnblogs.com/hygeia/p/4643836.html
