11/12/2020

Author: jameszu

Daily-challenge/Dec/10/README.md

@@ -33,11 +33,21 @@ Constraints:
 
 ## Code
 ```python
-class Solution(object):
-    def flipAndInvertImage(self, A):
-        result = []
-        for row in A:
-            result.append(list(map(lambda x: 0 if x == 1 else 1, row[::-1])))
-        return result
+class Solution:
+    def validMountainArray(self, arr: List[int]) -> bool:
+        if len(arr) < 3:
+            return False
+        i = 1
+        test = False
+        test1 = False
+        while i <= len(arr)-1 and arr[i] > arr[i-1]:
+            i += 1
+            test1 = True
+            
+        while i <= len(arr)-1 and arr[i] < arr[i-1]:
+            i += 1
+            test = True
+        return i-1 == len(arr) -1 and test and test1
+                
 ```
 

Daily-challenge/Dec/10/sol.py

@@ -1,6 +1,16 @@
-class Solution(object):
-    def flipAndInvertImage(self, A):
-        result = []
-        for row in A:
-            result.append(list(map(lambda x: 0 if x == 1 else 1, row[::-1])))
-        return result
+class Solution:
+    def validMountainArray(self, arr: List[int]) -> bool:
+        if len(arr) < 3:
+            return False
+        i = 1
+        test = False
+        test1 = False
+        while i <= len(arr)-1 and arr[i] > arr[i-1]:
+            i += 1
+            test1 = True
+            
+        while i <= len(arr)-1 and arr[i] < arr[i-1]:
+            i += 1
+            test = True
+        return i-1 == len(arr) -1 and test and test1
+