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.

方法一：直接遍历，暴力求解

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