From 0bb07f39e8e1b2e37ce6866b061afb569025fc14 Mon Sep 17 00:00:00 2001
From: yqq <youngqqcn@163.com>
Date: Mon, 20 Sep 2021 16:10:18 +0800
Subject: [PATCH] =?UTF-8?q?941.=E6=9C=89=E6=95=88=E7=9A=84=E5=B1=B1?=
 =?UTF-8?q?=E8=84=89=E6=95=B0=E7=BB=84,=20=E5=A2=9E=E5=8A=A0Python,=20Gola?=
 =?UTF-8?q?ng=E5=AE=9E=E7=8E=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0941.有效的山脉数组.md | 42 ++++++++++++++++++++++++--
 1 file changed, 40 insertions(+), 2 deletions(-)

diff --git a/problems/0941.有效的山脉数组.md b/problems/0941.有效的山脉数组.md
index 607031da..c4c8ebfa 100644
--- a/problems/0941.有效的山脉数组.md
+++ b/problems/0941.有效的山脉数组.md
@@ -7,7 +7,7 @@
 </p>
 <p align="center"><strong>欢迎大家<a href="https://mp.weixin.qq.com/s/tqCxrMEU-ajQumL1i8im9A">参与本项目</a>，贡献其他语言版本的代码，拥抱开源，让更多学习算法的小伙伴们收益！</strong></p>
 
-# 941.有效的山脉数组 
+# 941.有效的山脉数组
 
 [力扣题目链接](https://leetcode-cn.com/problems/valid-mountain-array/)
 
@@ -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