leetcode 941 (easy)

문제

https://leetcode.com/problems/valid-mountain-array/

내 코드

class Solution:
    def validMountainArray(self, arr: List[int]) -> bool:
        if len(arr) < 3:
            return False
        
        j = 0
        for i in range(len(arr)-1):
            if arr[i+1] == arr[i]:
                return False
            
            if arr[i+1] < arr[i]:
                j = i
                break
                
        if j==0:  ## 끝까지 쭉 증가한경우
            return False
        
        while j < len(arr)-1:
            if arr[j+1] >= arr[j]:
                return False
            
            j += 1
            
        return True

결과