/*
* leftright, left>right,right;
* 
* 
*/
class Solution {
public:
    int findMin(vector& nums) {
        int count = nums.size();
        if (count == 1) {
            return nums[0];
        }
            
        int left  = nums[0];
        int right = nums[1];
        if (left > right) {
            return right;    
        }
        
        int i;
        for (i = 2; i < count; i++) {
            left  = right;
            right = nums[i];
            
            if (left > right) {
                return right;    
            }
        }
        
        if (i == count) {
            return nums[0];
        }
        
        return -1;
    }
};