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.

解题思路：中间会存在一次数字次序的跳转

Java实现：

public class Solution {
    public int findMin(int[] nums) {
        int min=nums[0];
        for(int i=0;i<nums.length;i++){
            if(nums[i]<min) min=nums[i];
            if(nums[i]>nums[0]&&min!=nums[0]) return min;
            if(nums[i]<min&&min==nums[0]) return nums[i];
        }
        return min;
    }
}

原题题目： https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/