[leetcode] #162 Find Peak Element

A peak element is an element that is greater than its neighbors.

</pre><p style="margin-top:0px; margin-bottom:10px; color:rgb(51,51,51); font-family:'Helvetica Neue',Helvetica,Arial,sans-serif; font-size:14px; line-height:30px">Given an input array where <code style="font-family:Menlo,Monaco,Consolas,'Courier New',monospace; font-size:12.6000003814697px; padding:2px 4px; color:rgb(199,37,78); background-color:rgb(249,242,244)">num[i] ≠ num[i+1]</code>, find a peak element and return its index.</p><p style="margin-top:0px; margin-bottom:10px; color:rgb(51,51,51); font-family:'Helvetica Neue',Helvetica,Arial,sans-serif; font-size:14px; line-height:30px">The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.</p><p style="margin-top:0px; margin-bottom:10px; color:rgb(51,51,51); font-family:'Helvetica Neue',Helvetica,Arial,sans-serif; font-size:14px; line-height:30px">You may imagine that <code style="font-family:Menlo,Monaco,Consolas,'Courier New',monospace; font-size:12.6000003814697px; padding:2px 4px; color:rgb(199,37,78); background-color:rgb(249,242,244)">num[-1] = num[n] = -∞</code>.</p><p style="margin-top:0px; margin-bottom:10px; color:rgb(51,51,51); font-family:'Helvetica Neue',Helvetica,Arial,sans-serif; font-size:14px; line-height:30px">For example, in array <code style="font-family:Menlo,Monaco,Consolas,'Courier New',monospace; font-size:12.6000003814697px; padding:2px 4px; color:rgb(199,37,78); background-color:rgb(249,242,244)">[1, 2, 3, 1]</code>, 3 is a peak element and your function should return the index number 2.</p><p class="showspoilers" style="margin-top:0px; margin-bottom:10px; color:rgb(51,51,51); font-family:'Helvetica Neue',Helvetica,Arial,sans-serif; font-size:14px; line-height:30px"><a target=_blank target="_blank" href="https://leetcode.com/problems/find-peak-element/#" style="color:rgb(0,136,204); text-decoration:none; background:0px 0px">click to show spoilers.</a></p><p style="margin-top:0px; margin-bottom:10px; color:rgb(51,51,51); font-family:'Helvetica Neue',Helvetica,Arial,sans-serif; font-size:14px; line-height:30px"><span style="font-weight:700">Credits:</span><br style="" />Special thanks to <a target=_blank target="_blank" href="https://oj.leetcode.com/discuss/user/ts" style="color:rgb(0,136,204); text-decoration:none; background:0px 0px">@ts</a> for adding this problem and creating all test cases.</p><p style="margin-top:0px; margin-bottom:10px; font-family:'Helvetica Neue',Helvetica,Arial,sans-serif; font-size:14px; line-height:30px"><span style="color: rgb(51, 51, 51);">这道题的大意是找到</span><strong><span style="color:#ff0000">一个</span></strong><span style="color:#333333">数组中的极大值，也就是其值大于左值与右值的数的序号。</span></p><p style="margin-top:0px; margin-bottom:10px; font-family:'Helvetica Neue',Helvetica,Arial,sans-serif; font-size:14px; line-height:30px"><span style="color:rgb(51,51,51)">对于数组的首尾，num[0]与num[n-1]，分别视它们的左值和右值为</span><span style="background-color:rgb(255,255,255)">-<span style="font-family:Menlo,Monaco,Consolas,'Courier New',monospace; font-size:12.6000003814697px; line-height:30px">∞。</span></span></p><p style="margin-top:0px; margin-bottom:10px; font-family:'Helvetica Neue',Helvetica,Arial,sans-serif; font-size:14px; line-height:30px"><span style="background-color:rgb(255,255,255)"><span style="font-family:Menlo,Monaco,Consolas,'Courier New',monospace; font-size:12.6000003814697px; line-height:30px">原先看这道题还是median的题，觉得应该还有一定难度，但是没想到是个纸老虎，几行代码就搞定了。</span></span></p><p style="margin-top:0px; margin-bottom:10px; font-family:'Helvetica Neue',Helvetica,Arial,sans-serif; font-size:14px; line-height:30px"></p><pre name="code" class="cpp">int findPeakElement(int num[], int n) {
    
    for (int i=0;i<n-1;i++)
        if (num[i]>num[i+1])
            return i;
    return n-1;
}

把整个数组想象成一座山，需要找到第一个山峰，根据条件num[-1]=- ∞，一开始我们就处于上山状态，那么一直往前走，看到前方要下山了(num[i]>num[i+1])，目前所在就是山峰。

这道题不需要考虑多个极大值的情况，找到一个即可。如果需要找到所有的极大值，那么也不难，只是判断条件要多一点。