162. Find Peak Element
来源:互联网 发布:福利直播软件 编辑:程序博客网 时间:2024/05/16 16:23
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) { if(nums.size() <= 1) return 0; int index = 0, pre = nums[0]; for(int i = 1; i < nums.size(); i ++){ if(nums[i] > pre) pre = nums[i]; else if(nums[i] < pre) return i - 1; } return nums.size() - 1; }};
阅读全文
0 0
- 162. Find Peak Element
- 162. Find Peak Element
- 162. Find Peak Element
- 162. Find Peak Element
- 162. Find Peak Element
- 162. Find Peak Element
- 162. Find Peak Element
- 162. Find Peak Element
- 162. Find Peak Element
- 162. Find Peak Element
- 162. Find Peak Element
- 162. Find Peak Element
- 162. Find Peak Element
- 162. Find Peak Element
- 162. Find Peak Element
- 162. Find Peak Element
- 162. Find Peak Element
- 162. Find Peak Element
- 选择标签中不包含指定标签的其他元素
- 编程范式13 笔记
- diff命令---待完善
- java代码转Smali代码
- material design 之 ripple(波纹)效果
- 162. Find Peak Element
- @RequiresPermissions 控制权限的异常处理以及Ajax方式请求时返回json
- 不规则卷积神经网络
- 插入、冒泡、归并、堆排序、快排总结
- Java学习线路
- 引用作为返回值的
- 关于EOS的部署
- opencv 实现任意角度的透视变换
- SVN的安装和关联Android Studio的重要步骤