[刷题]Find Minimum in Rotated Sorted Array II

[LintCode]Find Minimum in Rotated Sorted Array II

public class Solution {
    /**
     * @param num: a rotated sorted array
     * @return: the minimum number in the array
     */
    public int findMin(int[] num) {
        // 2015-07-20
        if (num == null || num.length == 0) {
            return 0; // throw exception
        } 
        if (num.length == 1) {
            return num[0];
        }
        
        int start = 0;
        int end = num.length - 1;
        
        while (start + 1 < end) {
            int mid = (start + end) / 2;
            if (num[start] == num[mid] || num[start] == num[end]) {
                start++;
                continue;
            }
            if (num[end] == num[mid]) {
                end--;
                continue;
            }
            // num[start] num[mid] num[end] 两两不等
            if (num[start] < num[end]) {
                return num[start];
            } else {
                if (num[start] < num[mid]) {
                    start = mid;                
                } else {
                    end = mid;
                }
            }
        }
        
        if (num[start] < num[end]) {
            return num[start];
        } else {
            return num[end];
        }
    }
}