寻找峰值_牛客题霸_牛客网
int findPeakElement(vector<int>& nums) {// write code hereint left = 0, right = nums.size() - 1;while(left < right){int mid = (right - left) / 2 + left;if(nums[mid] < nums[mid + 1])left = mid + 1;elseright = mid;}return left;}
寻找峰值_牛客题霸_牛客网
int findPeakElement(vector<int>& nums) {// write code hereint left = 0, right = nums.size() - 1;while(left < right){int mid = (right - left) / 2 + left;if(nums[mid] < nums[mid + 1])left = mid + 1;elseright = mid;}return left;}
本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.mzph.cn/diannao/31177.shtml
如若内容造成侵权/违法违规/事实不符,请联系多彩编程网进行投诉反馈email:809451989@qq.com,一经查实,立即删除!