【LeetCode】#153寻找旋转排序数组中的最小值(Find Minimum in Rotated Sorted Array)

【LeetCode】#153寻找旋转排序数组中的最小值(Find Minimum in Rotated Sorted Array)

题目描述

假设按照升序排序的数组在预先未知的某个点上进行了旋转。
( 例如，数组 [0,1,2,4,5,6,7] 可能变为 [4,5,6,7,0,1,2] )。
请找出其中最小的元素。
你可以假设数组中不存在重复元素。

示例

示例 1:

输入: [3,4,5,1,2]
输出: 1

示例 2:

输入: [4,5,6,7,0,1,2]
输出: 0

Description

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.

Example

Example 1:

Input: [3,4,5,1,2]
Output: 1

Example 2:

Input: [4,5,6,7,0,1,2]
Output: 0

解法

class Solution {
    public int findMin(int[] nums) {
        int small=0, big=nums.length-1;
        int res = 0;
        if(small==big){
            return nums[small];
        }
        boolean flag = false;
        while(small<big){
            if(nums[small]>nums[small+1]){
                res = nums[small+1];
                flag = true;
                break;
            }
            if(nums[big]<nums[big-1]){
                res = nums[big];
                flag = true;
                break;
            }
            small++;
            big--;
        }
        if(flag){
            return res;
        }else{
            return nums[0];
        }
    }
}