Longest Mountain in Array Python Solution

lcpy gen -n 845   # by problem number
lcpy gen -s longest_mountain_in_array   # by problem name

Input: arr = [2,1,4,7,3,2,5]
Output: 5
Explanation: The largest mountain is [1,4,7,3,2] which has length 5.

Input: arr = [2,2,2]
Output: 0
Explanation: There is no mountain.

class Solution:
    # Time: O(n)
    # Space: O(1)
    def longest_mountain(self, arr: list[int]) -> int:
        n = len(arr)
        longest = 0
        i = 1
        while i < n:
            if arr[i - 1] < arr[i]:
                start = i - 1
                while i < n and arr[i - 1] < arr[i]:
                    i += 1
                peak = i - 1
                while i < n and arr[i - 1] > arr[i]:
                    i += 1
                if peak < i - 1:
                    longest = max(longest, i - start)
            else:
                i += 1
        return longest