leetcode 寻找峰值

# 原来的逻辑  找到索引最大的那个山峰元素并返回其索引

class Solution:
    def solve(self , a ):
        # write code here
        n = len(a)
        if a[n-1] > a[n-2]:
            return n-1
        if a[0]>a[1]:
            return 0
        i=n-2
        while i>0:
            if a[i-1]<a[i] and a[i+1]<a[i]:
                return i
            i-=1

 # 新的逻辑  找到最大的那个山峰元素并返回其索引

class Solution:
    def solve(self , a ):
        # write code here
        resu = 0
        index = 0
        
        if len(a) == 0:
            return None
        if len(a) == 1:
            resu = a
            return 0
        
        for i in range(len(a)):

            if i == 0 and a[i] > resu:
                resu = a[i]
                index = i
            if (i < len(a)-1) and (a[i] > resu) and (a[i] >= a[i-1]) and (a[i] >= a[i+1]):
                resu = a[i]
                index = i
                
            if (i== len(a)-1) and (a[i] >= a[i-1]) and (a[i] > resu):
                resu = a[i]
                index = i
                
        return index