class Solution { public int findMin(int[] nums) { int lo=0; int hi=nums.length-1; while(lo nums[hi]) lo=mid+1; else hi--; } return nums[lo]; }}
本文共 294 字，大约阅读时间需要 1 分钟。
class Solution { public int findMin(int[] nums) { int lo=0; int hi=nums.length-1; while(lo nums[hi]) lo=mid+1; else hi--; } return nums[lo]; }}
转载于:https://www.cnblogs.com/asuran/p/7720205.html