Rotated Sorted Array I II

(1)

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.

You may assume no duplicate exists in the array.

import java.util.ArrayList;
//不考虑重复
public class Solution {
    public int minNumberInRotateArray(int [] array) {
    	int L = 0,R = array.length-1,mid = 0;
        while(L + 1 < R){
            mid = L + (R - L)/2;
            if(array[mid] <= array[R]){
                R = mid;
            }else{
                L = mid;
            }
        }
        //return array[R];
        return array[R] > array[L]?array[L]:array[R];//处理旋转0个元素的情况
    }
}

(2)

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.

class Solution {
    public int findMin(int[] nums) {
        int L = 0,R = nums.length-1,mid = 0;
        while(L + 1 < R){
            mid = L + (R - L)/2;
            if(nums[mid] == nums[R])
                R--;//无法确定往哪边移，既然存在相同，只保留一个即可。
            else if(nums[mid] < nums[R])
                R = mid;
            else
                L = mid;
        }
        return nums[L]<=nums[R]?nums[L]:nums[R];
    }
}