题解 | #寻找峰值#

思路

找到最后一个即可，所以将数组反转后再找。

class Solution:
    def target_index(self, nums, index):
        return len(nums) - index - 1

    def solve(self, nums):
        # write code here
        nums = nums[::-1] 
        if len(nums) == 1:
            return 0
        for index in range(1, len(nums)):
            first = nums[index - 1]
            second = nums[index]
            third = nums[index + 1]
            if first > second:
                return self.target_index(nums, index - 1)
            if not third:
                return self.target_index(nums, index)
            if second > third:
                return  self.target_index(nums, index)