Java for Leetcode 154 Find Minimum in rotated Sorted Array II

Suppose a sorted array is rotated on 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.

Problem Solving Ideas:

Refer to Java for Leetcode 081 Search in rotated Sorted Array II Java implementation as follows:

public int findmin (int[] nums) {int left = 0, right = nums.length-1, res = Nums[0];while (left <= right) {res =  M Ath.min (Nums[left],math.min (res, nums[(right + left)/2]), if (nums[(right + left)/2] < Nums[left]) Left)/2-1;else if (nums[(right + left)/2] > Nums[left]) left = (right + left)/2 + 1;elseleft++;} return res;}

Java for Leetcode 154 Find Minimum in rotated Sorted Array II