# Longest Mountain in Array

Let's call any (contiguous) subarray B (of A) a\_mountain\_if the following properties hold:

```
B.length >= 3
There exists some 0 < i < B.length - 1 such that B[0] < B[1] < ... B[i-1] < B[i] > B[i+1] > ... > B[B.length - 1]
```

(Note that B could be any subarray of A, including the entire array A.)

Given an array`A` of integers, return the length of the longest *mountain*.

Return`0`if there is no mountain.

**Example 1:**

```
Input: 
[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: 
[2,2,2]

Output: 
0

Explanation: 
There is no mountain.
```

**Note:**

```
0 <= A.length <= 10000
0 <= A[i] <= 10000
```

**Follow up:**

* Can you solve it using only one pass?
* Can you solve it in`O(1)`space?

分析

可以forward backward遍历，2个数组up and down，最后遍历一遍相加。反向遍历也是按照递增来做

```
class Solution:
    def longestMountain(self, A: List[int]) -> int:
        maxl = 0
        ll = len(A)
        up = [0]*ll
        down = [0]*ll

        for i in range(1,ll):
            if A[i] > A[i-1]: up[i] = up[i-1] + 1
        for i in reversed(range(ll-1)):
            if A[i] > A[i+1]: down[i] = down[i+1] + 1


        return  max([u+d+1 for u,d in zip(up,down) if u and d] or [0])
```

或者直接up,down2个变量，一次遍历，遇到不合条件：1 down>0 and 开始增加 2 ==

起始点为0，高/低一个就加1

```
class Solution:
    def longestMountain(self, A: List[int]) -> int:
        maxl = up=down=0
        ll = len(A)
        for i in range(1,ll):
            if (down and A[i] >= A[i-1]) or (up and A[i] == A[i-1]):
                up = down = 0

            up += A[i] > A[i-1] #巧妙用法
            down += A[i] < A[i-1]
            if up and down:maxl = max(maxl, up + down +1) #注意一定要同时>0才行
        return maxl
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://nataliekung.gitbook.io/ladder_code/qiang-hua-4-shuang-zhi-zhen-ff09/longest-mountain-in-array.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.