题解 | #寻找峰值#

# -*- coding: utf-8 -*-

#
# 寻找最后的山峰
# @param a int整型一维数组
# @return int整型
#
class Solution:
    def solve(self , a):
        # write code here
        max_num = len(a)
        max_index=0
        for i in range(max_num):
            if i==0:
                pass
            elif i==max_num - 1:
                if a[i]>=a[i-1]:
                    if i>max_index:
                        max_index=i
            else:
                if a[i]>=a[i-1] and a[i]>=a[i+1]:
                    if i>max_index:
                        max_index=i
        return max_index

s=Solution()
print(s.solve([2,4,1,2,7,8,4]))