###### [leetcode]153. Find Minimum in Rotated Sorted Array
class Solution {
public:
int findMin(vector<int>& nums) {
int len=nums.size();
return find(nums,0,len-1);
}
int find(vector<int>&nums,int l,int r )
{
if(l==r)
return nums[l];
int m=(l+r)/2;

if(nums[l]<=nums[m]&&nums[m]<=nums[r])

return nums[l];
if(nums[l]>=nums[m]&&nums[m]>=nums[r])
return nums[r];

if(nums[l]>nums[r]&&nums[m]<nums[r])

return find(nums,l,m);

return find(nums,m,r);

}
};

#### [LeetCode]153.Find Minimum in Rotated Sorted Array

2015-01-31 17:21:26

#### leetcode 153: Find Minimum in Rotated Sorted Array

2014-12-30 04:30:30

#### LeetCode(153)Find Minimum in Rotated Sorted Array

2015-01-21 06:04:50

#### 153.Find Minimum in Rotated Sorted Array [LeetCode Java实现]

2015-03-19 19:03:14

#### leetcode_c++： Find Minimum in Rotated Sorted Array （153）

2016-06-11 23:28:59

#### Find Minimum in Rotated Sorted Array -- LeetCode

2014-10-25 07:11:17

#### 【LeetCode-面试算法经典-Java实现】【153-Find Minimum in Rotated Sorted Array（找旋转数组中的最小数字）】

2015-08-21 06:24:18

#### Find Minimum in Rotated Sorted Array II -- LeetCode

2014-10-25 07:12:45

#### LeetCode(154) Find Minimum in Rotated Sorted Array II

2015-01-21 09:10:48

#### Search in Rotated Sorted Array II -- LeetCode

2014-03-06 02:04:55

## 不良信息举报

[leetcode]153. Find Minimum in Rotated Sorted Array