1
class Solution:
2
def validMountainArray(self, arr: List[int]) -> bool:
3
if len(arr) <= 2 or max(arr) == arr[0] or max(arr) == arr[len(arr) - 1]:
4
return False
5
f = True
6
for i in range(len(arr) - 1):
7
if f and arr[i] >= arr[i + 1]:
8
f = False
9
if not f and arr[i] <= arr[i + 1]:
10
return False
11
return True

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0