Fix

Author: jinbeom

3sum/kayden.py

@@ -50,6 +50,9 @@ def threeSum2(self, nums: List[int]) -> List[List[int]]:
                     while nums[l] == nums[l - 1] and l < r:
                         l += 1
 
+                    while nums[r] == nums[r + 1] and l < r:
+                        r -= 1
+
                 if nums[l] + nums[r] < -nums[i]:
                     l += 1
 

word-break/kayden.py

@@ -1,18 +1,18 @@
-# 시간복잡도: ?
+# 시간복잡도: O(S*W)
+#   S: s의 길이 300 W: worDict 각 단어의 총 길이 20*1000
+#       300 * 20*1000 = 6*1e6 (600만)
 # 공간복잡도: O(S)
 class Solution:
     def wordBreak(self, s: str, wordDict: List[str]) -> bool:
         memo = {}
-        wordSet = set(wordDict)
-
         def dfs(idx):
             if idx in memo:
                 return memo[idx]
 
             if idx == len(s):
                 return True
 
-            for word in wordSet:
+            for word in wordDict:
                 l = len(word)
                 if s[idx:idx + l] == word:
                     if dfs(idx + l):