LeetCode 新题: Find Minimum in Rotated Sorted Array II 解题报告-二分法模板解法

public class Solution {
public int findMin(int[] num) {
if (num == null || num.length == 0) {
return 0;
}

int l = 0;
int r = num.length - 1;

while (l < r - 1) {
int mid = l + (r - l) / 2;

// The array is sorted.
if (num[l] < num[r]) {
return num[l];
}

if (num[mid] < num[r]) {
r = mid;
// left side is sorted. discard the left side.
} else if (num[mid] > num[l]) {
l = mid;
} else {
l++;
}
}

return Math.min(num[l], num[r]);
}
}