Leetcode98: Find Peak Element
来源:互联网 发布:周易算法算快三 编辑:程序博客网 时间:2024/05/16 07:40
A peak element is an element that is greater than its neighbors.
Given an input array where num[i] ≠ num[i+1]
, find a peak element and return its index.
The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.
You may imagine that num[-1] = num[n] = -∞
.
For example, in array [1, 2, 3, 1]
, 3 is a peak element and your function should return the index number 2.
二分查找法
class Solution {public: int findPeakElement(vector<int>& nums) { int n = nums.size(); int left = 0; int right = n-1; while(left<=right) { if(left == right) return left; int mid = (left+right)/2; if(nums[mid]>nums[mid+1]) right = mid; else left = mid+1; } }};
0 0
- Leetcode98: Find Peak Element
- [LeetCode] Find Peak Element
- Find Peak Element
- Leetcode:Find Peak Element
- Find Peak Element
- Find Peak Element
- Find Peak Element
- LeetCode Find Peak Element
- leetcode: Find Peak Element
- leetcode:Find Peak Element
- Find Peak Element
- Find Peak Element
- Find Peak Element
- LeetCode Find Peak Element
- Find Peak Element --leetcode
- Leetcode Find Peak Element
- [LeetCode] Find Peak Element
- Find Peak Element [Medium]
- iOS---仿京东分类菜单实例实现
- 安卓adb工具的安装方法
- 纹理
- gridview 有链接列
- 算法导论13.2旋转 练习总结
- Leetcode98: Find Peak Element
- 瞬时响应:网站的高性能架构
- Openlayers3加载图层上所有数据
- SQL Tuning 调优
- android studio快速定位工程错误
- C语言——分配内存
- IOS开发中的几种设计模式介绍
- 推荐大家使用的CSS书写规范、顺序
- ANT打包 ,build.xml文件