Follow up for "Find Minimum in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

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.

The array may contain duplicates.

public class Solution {
    public int findMin(int[] num) {
        for(int i = 1; i < num.length; i++){
            if(num[i] < num[i-1]){//降序
                return num[i];
            }
        }
        return num[0];
    }
}

Runtime: 212 ms

神马个情况，难道是我的网速快了，第一次写出这么快代码，低调，或许真的是自己的网速快了，淡定

Find Minimum in Rotated Sorted Array II