[kayden] Week 05 Solutions

best-time-to-buy-and-sell-stock/kayden.py

@@ -0,0 +1,15 @@
+# 시간복잡도: O(N)
+# 공간복잡도: O(1)
+class Solution:
+    def maxProfit(self, prices: List[int]) -> int:
+
+        answer = 0
+        cur = float(inf)
+        for price in prices:
+            if cur < price:
+                answer = max(answer, price - cur)
+
+            if price < cur:
+                cur = price
+
+        return answer

group-anagrams/kayden.py

@@ -0,0 +1,10 @@
+# 시간복잡도: O(N*AlogN) A: 0<= strs[i]의 길이 <= 100
+# 공간복잡도: O(N)
+class Solution:
+    def groupAnagrams(self, strs: List[str]) -> List[List[str]]:
+        groups = {}
+        for anagram in strs:
+            key = str(sorted(anagram))
+            groups.setdefault(key, []).append(anagram)
+
+        return list(groups.values())