leetcode :Find Minimum in Rotated Sorted Array

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.

题目的大意是：在一个排过序，然后从其中的某点旋转过的数组中找到最小的值。经过测试发现遍历一遍的方法也可以通过（感觉测试数据不是很好）。

结题思路：分治法。直接上代码：

int help(vector<int> &num, int start, int end){
	if(num[start] < num[end])
		return num[start];

	int mid = (start + end) / 2;

	if(num[start] < num[mid] ){
		int tmp = help(num,mid+1,end);
		return tmp < num[start]? tmp:num[start];
	}
	else if(num[start] == num[mid]){
		return num[start] < num[end] ? num[start] : num[end];
	}
	else{
		int tmp = help(num,start,mid - 1);
		return tmp < num[mid]? tmp:num[mid];
	}

}

int findMin(vector<int> &num) {
	int len = num.size();
	if(num.empty())
		return - 1;
	return help(num,0,len - 1);
	return 0;
}