Leetcode 154: Find Minimum in Rotated Sorted Array II

Suppose an array sorted in ascending order 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[] nums) {
        int low = 0, high = nums.Length - 1, min = Int32.MaxValue;
        
        while (low <= high)
        {
            min = Math.Min(min, Math.Min(nums[low], nums[high]));
            
            int mid = low + (high - low) / 2;
            
            min = Math.Min(min, nums[mid]);
            
            if (nums[low] < nums[mid])
            {
                low = mid + 1;
            }
            else if (nums[low] == nums[mid])
            {
                low = low + 1;
            }
            else
            {
                high = mid - 1;
            }
        }
        
        return min;
    }
}