#845
Longest Mountain in Array
specialist · 980 · lc medium +32 · verified · 41.9% accepted · 3,032 likes · top 23%
Description
An array arr is a mountain array if and only if:
- arr.length >= 3
- There exists an index i (0-indexed) with 0 < i < arr.length - 1 such that:
- arr[0] < arr[1] < ... < arr[i - 1] < arr[i]
- arr[i] > arr[i + 1] > ... > arr[arr.length - 1]
Given an integer array arr, return the length of its longest mountain subarray. Return 0 if no mountain subarray exists.
Example 1:
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.
Example 2:
Input: arr = [2,2,2]
Output: 0
Explanation: There is no mountain.
Code
1
2
3