—Easy
https://leetcode.com/problems/peak-index-in-a-mountain-array/
Code:
class Solution: def peakIndexInMountainArray(self, A) -> int: ans_flag = False for i in range(len(A)-1): if A[i] > A[i+1]: break return i # s = Solution() # print(s.peakIndexInMountainArray([0,1,2,6,2,1,0]))
思路:
1.第一次错了是因为看成了判断是不是peak,没想到....