Find Min In Rotated Sorted Array，寻找反转序列中最小的元素。

 1 public int findMin(int[] nums)
 2         {
 3             return findMin(nums, 0, nums.length - 1);
 4         }
 5         //递归
 6         public int findMin(int[] nums, int left, int right)
 7         {
 8             if(left == right)
 9             {
10                 return nums[left];
11             }
12             if(nums[left] < nums[right])//例如34512，在截取子序列时候，很可能就得到一个顺序序列，这时候直接判断。
13             {
14                 return nums[left];
15             }
16             int mid = (left+right)/2;
17             if(nums[left] < nums[mid])
18             {
19                 return findMin(nums, mid+1, right);
20             }
21             else
22             {
23                 return findMin(nums, left, mid);
24             }
25         }
26         
27         //迭代
28         public int findMin2(int[] nums, int left, int right)
29         {
30             while(left <= right)
31             {
32                 if(nums[left] < nums[right])
33                 {
34                     return nums[left];
35                 }
36                 if(left == right)
37                 {
38                     return nums[left];
39                 }
40                 int mid = (left+right)/2;
41                 if(nums[left] <= nums[mid])
42                 {
43                     left = mid + 1;
44                 }
45                 else
46                 {
47                     right = mid;
48                 }
49             }
50             return -1;
51         }