Merge pull request #2193 from 8804who/main

[8804who] WEEK 06 solutions

Author: 8804who

container-with-most-water/8804who.py

@@ -0,0 +1,15 @@
+class Solution:
+    def maxArea(self, height: List[int]) -> int:
+        answer = 0
+        start, end = 0, len(height)-1
+
+        while start <= end:
+            area = (end-start)*(height[start] if height[start]<height[end] else height[end])
+            if area > answer:
+                answer = area
+            if height[start] < height[end]:
+                start += 1
+            else:
+                end -= 1
+        return answer
+    

design-add-and-search-words-data-structure/8804who.py

@@ -0,0 +1,33 @@
+class WordDictionary:
+
+    def __init__(self):
+        self.trie = {}
+        
+
+    def addWord(self, word: str) -> None:
+        level = self.trie
+
+        for i in range(len(word)):
+            if word[i] not in level:
+                level[word[i]] = {}
+            level = level[word[i]]
+        level['end'] = True
+    def search(self, word: str) -> bool:
+        def dfs(idx, word, level):
+            if idx == len(word):
+                if 'end' in level:
+                    return True
+                else:
+                    return False
+            if word[idx] == '.':
+                for i in level.keys():
+                    if i != 'end' and dfs(idx+1, word, level[i]):
+                        return True
+                return False
+            else:
+                if word[idx] in level:
+                    return dfs(idx+1, word, level[word[idx]])
+                else:
+                    return False
+        return dfs(0, word, self.trie)
+    

longest-increasing-subsequence/8804who.py

@@ -0,0 +1,13 @@
+from bisect import bisect_left
+class Solution:
+    def lengthOfLIS(self, nums: List[int]) -> int:
+        dp = [nums[0]]
+
+        for num in nums[1:]:
+            if num>dp[-1]:
+                dp.append(num)
+            else:
+                dp[bisect_left(dp, num)] = num
+
+        return len(dp)
+    

spiral-matrix/8804who.py

@@ -0,0 +1,26 @@
+class Solution:
+    def spiralOrder(self, matrix: List[List[int]]) -> List[int]:
+        answer = []
+
+        y_s, y_e = 0, len(matrix)-1
+        x_s, x_e = 0, len(matrix[0])-1
+
+        while y_s <= y_e and x_s <= x_e:
+            for i in range(x_s, x_e+1):
+                answer.append(matrix[y_s][i])
+            for i in range(y_s+1, y_e+1):
+                answer.append(matrix[i][x_e])
+
+            if y_s==y_e or x_s==x_e:
+                break
+
+            for i in range(x_e-1, x_s-1, -1):
+                answer.append(matrix[y_e][i])
+            for i in range(y_e-1, y_s, -1):
+                answer.append(matrix[i][x_s])
+
+            y_s, y_e = y_s+1, y_e-1
+            x_s, x_e = x_s+1, x_e-1
+        
+        return answer
+    

valid-parentheses/8804who.py

@@ -0,0 +1,21 @@
+class Solution:
+    def isValid(self, s: str) -> bool:
+        stack = []
+        s = list(s)
+
+        while s:
+            if s[-1] in [')', '}', ']']:
+                stack.append(s[-1])
+            elif s[-1] == '(':
+                if not stack or stack.pop() != ')':
+                    return False
+            elif s[-1] == '{':
+                if not stack or stack.pop() != '}':
+                    return False
+            else:
+                if not stack or stack.pop() != ']':
+                    return False
+            s.pop()
+            
+        return False if stack else True
+