public int findPeakElement(int[] nums) {
if (nums.length == 0)return 0;
int left = 0;
int right = nums.length - 1;
while (left < right){
int mid = left + (right - left)/2;
if (nums[mid] < nums[right]){
left = mid +1;
}else {
right--;
}
}
return right;
}
LeetCode162题
最新推荐文章于 2023-12-25 00:15:00 发布