mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 03:34:02 +08:00
941.有效的山脉数组, 增加Python, Golang实现
This commit is contained in:
@ -103,14 +103,52 @@ class Solution {
|
||||
}
|
||||
```
|
||||
|
||||
## Python
|
||||
## Python3
|
||||
|
||||
```python
|
||||
class Solution:
|
||||
def validMountainArray(self, arr: List[int]) -> bool:
|
||||
if len(arr) < 3 :
|
||||
return False
|
||||
|
||||
i = 1
|
||||
flagIncrease = False # 上升
|
||||
flagDecrease = False # 下降
|
||||
|
||||
while i < len(arr) and arr[i-1] < arr[i]:
|
||||
flagIncrease = True
|
||||
i += 1
|
||||
|
||||
while i < len(arr) and arr[i-1] > arr[i]:
|
||||
flagDecrease = True
|
||||
i += 1
|
||||
|
||||
return i == len(arr) and flagIncrease and flagDecrease
|
||||
|
||||
```
|
||||
|
||||
## Go
|
||||
|
||||
```go
|
||||
func validMountainArray(arr []int) bool {
|
||||
if len(arr) < 3 {
|
||||
return false
|
||||
}
|
||||
|
||||
i := 1
|
||||
flagIncrease := false // 上升
|
||||
flagDecrease := false // 下降
|
||||
|
||||
for ; i < len(arr) && arr[i-1] < arr[i]; i++ {
|
||||
flagIncrease = true;
|
||||
}
|
||||
|
||||
for ; i < len(arr) && arr[i-1] > arr[i]; i++ {
|
||||
flagDecrease = true;
|
||||
}
|
||||
|
||||
return i == len(arr) && flagIncrease && flagDecrease;
|
||||
}
|
||||
```
|
||||
|
||||
## JavaScript
|
||||
|
Reference in New Issue
Block a user