LeetCode51|寻找旋转排序数组中的最小值

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

 
import java.util.Arrays;

public class FindMinTest {
    public static void main(String[] args) {
        int [] nums={3,4,5,1,2};
        int a = findMin(nums);
        System.out.println("a = " + a);


    }

    public static  int findMin(int[] nums) {
        if (nums == null || nums.length == 0) {
            return -1;
        }
        Arrays.sort(nums);
        return nums[0];
    }
}