160题 Find Minimum in Rotated Sorted Array II

Find Minimum in Rotated Sorted Array II

Description
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.

public class Solution {
    /**
     * @param nums: a rotated sorted array
     * @return: the minimum number in the array
     */
    public int findMin(int[] nums) {
        // write your code here
        int start = Integer.MAX_VALUE , end = nums.length - 1 ;
        for(int i = 0 ; i <= end ; i++){
            if(nums[i] < start){
                start = nums[i] ;
            }

        }
        return start ;
    }
}