public intfindMin(int[] nums){int left =0, right = nums.length -1;while(left < right){int mid = left +(right - left)/2;if(nums[mid]< nums[right]){
right = mid;}elseif(nums[mid]> nums[right]){
left = mid +1;}else{return nums[mid];}}return nums[left];}