int findPeakElement(int* nums, int numsSize){ int l = 0, r = numsSize - 1; while (l < r) { int mid = (l + r) / 2; if (nums[mid] > nums[mid + 1]) r = mid; else l = mid + 1; } return l; }
【leetcode】162. 寻找峰值
原文：https://www.cnblogs.com/ganxiang/p/14183363.html
