[LeetCode]: 153: Find Minimum in Rotated Sorted Array

標籤：

題目：

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

 

思路1：硬遍曆，當出現"翻轉"的時候，返回翻轉地區的最小值

 

代碼：

    public int findMin(int[] nums) {        if(nums.length == 1){            return nums[0];        }                        int iResult = nums[0];        for(int i =1 ;i< nums.length;i++){            if( nums[i]< nums[i-1]  && iResult > nums[i]){                return nums[i];            }        }                return iResult;    }

 

思路2

[LeetCode]: 153: Find Minimum in Rotated Sorted Array