leetcode 153 —— 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.

1.线性法 

class Solution {
public:
	int findMin(vector<int>& nums) {
		int len = nums.size();
		if (len == 1)
			return nums[0];
		int i = 0;
		for (i; i < len - 1; i++){
			if (nums[i]>nums[i + 1]){
				return nums[i + 1];
			}
		}
		return nums[0];
	}
};

2.二分搜索

class Solution {
public:
	
	int findMin(vector<int>& nums) {
		int n = nums.size();
		int left = 0;
		int right = n - 1;
		
		while (left <= right) {
			if (nums[left] <= nums[right])
				return nums[left];
			int mid = (left + right) >> 1;

			if (nums[mid] < nums[right])
				right = mid;
			else
				left = mid + 1;
		}

		return nums[left];
	}
};