LeetCode OJ 154. Find Minimum in Rotated Sorted Array II

 1 public class Solution {
 2     public int findMin(int[] nums) {
 3         int start=0,mid=0,end=nums.length-1;
 4         while(start<end){
 5             if(nums[start] < nums[end]) return nums[start];
 6             
 7             mid=start+(end-start)/2;
 8             if(nums[mid]>nums[end]) start=mid+1;
 9             else if(nums[mid]==nums[end]) end--;
10             else end=mid;
11         }
12         return nums[start];
13     }
14 }

 1 public class Solution {
 2     public int findMin(int[] nums) {
 3         int len = nums.length;
 4         if(len == 1) return nums[0];
 5 
 6         return find(nums, 0, len-1);
 7     }
 8     
 9     public int find(int nums[], int left, int right){
10         while(left < right){
11             if(nums[left] < nums[right]) return nums[left];
12             if(left == right - 1) return Math.min(nums[left], nums[right]);
13             
14             int mid = left + (right - left)/2;
15             if(nums[left] == nums[mid] && nums[mid] == nums[right])
16                 return Math.min(find(nums, left, mid-1), find(nums, mid+1, right));
17                 
18             if(nums[left] <= nums[mid]) left = mid + 1;
19             else right = mid;
20         }
21         return nums[left];
22     }
23 }