[leetcode]153.154.Find Minimum in Rotated Sorted Array

来源:互联网 发布:班旗设计软件 编辑:程序博客网 时间:2024/05/10 20:33
public class Solution {    public int findMin(int[] nums) {        int res = Integer.MAX_VALUE;for (int i = 0, j = 1; i < nums.length && j < nums.length; i++, j++) {if (nums[i] > nums[j]) {res = Math.min(res, nums[j]);}}return res == Integer.MAX_VALUE ? nums[0] : res;    }}

0 0
原创粉丝点击