[main] Added maxArea

Author: cthacker-udel

pythonProblems/leetcode/isMatch.py

@@ -1,39 +1,37 @@
 class Solution:
     def isMatch(self, s: str, p: str) -> bool:
-        if '.' not in p and '*' not in p:
-            if len(s) == len(p):
-                return s == p
+
+        cache = {}
+
+        def dfs(i, j):
+
+            if (i, j) in cache:
+                return cache[(i, j)]
+
+            if i >= len(s) and j >= len(p):
+                return True
+            if j >= len(p):
+                return False
+
+            match = i < len(s) and (s[i] == p[j] or p[j] == '.')
+            if (j + 1) < len(p) and p[j + 1] == '*':
+                cache[(i, j)] = dfs(i, j + 2) or (match and dfs(i + 1, j))
+                return cache[(i, j)]
+
+            if match:
+                cache[(i, j)] = dfs(i + 1, j + 1)
+                return cache[(i, j)]
+
+            cache[(i, j)] = False
             return False
-        i = 0
-        j = 0
-        while j < len(p) - 1 and i < len(s):
-            if p[j + 1] == '*':
-                ## two decisions, whether to use or not to use
-                if s.count(p[j]) == 0 and p[j] != '.':
-                    ## choose not to use
-                    j += 2
-                    continue
-                elif p[j] == s[i] or p[j] == '.':
-                    for k in range(i, len(s)):
-                        if s[k] == p[j] or p[j] == '.':
-                            i += 1
-                        else:
-                            break
-                    j += 2
-
-            elif p[j] == '.':
-                j += 1
-            else:
-                if p[j] != s[i]:
-                    return False
-                else:
-                    j += 1
-                    i += 1
-        return p[j] == s[i] or p[j] == '.' if j < len(p) else True
+
+        return dfs(0, 0)
 
 
 if __name__ == '__main__':
     sol = Solution()
-    print(sol.isMatch("mississippi"
-                      "mis*is*p*."
+    print(sol.isMatch("aaa",
+                      "a*a"
+
+
                       ))

pythonProblems/leetcode/maxArea.py

@@ -0,0 +1,25 @@
+from typing import List
+
+
+class Solution:
+    def maxArea(self, height: List[int]) -> int:
+
+        left_ = 0
+        right_ = len(height) - 1
+        max_water = 0
+
+        while left_ != right_:
+            max_water = max(
+                (right_ - left_) * min(height[left_], height[right_]), max_water)
+            if height[left_] < height[right_]:
+                left_ += 1
+            elif height[right_] < height[left_]:
+                right_ -= 1
+            else:
+                left_ += 1
+        return max_water
+
+
+if __name__ == '__main__':
+    sol = Solution()
+    print(sol.maxArea([1, 8, 6, 2, 5, 4, 8, 3, 7]))