chore: 시간, 공간 복잡도 추가

Author: gusdn0828

.idea/workspace.xml

@@ -1,6 +1,8 @@
 """
 https://leetcode.com/problems/best-time-to-buy-and-sell-stock/
 """
+# - time complexity : O(n)
+# - space complexity : O(n)
 
 class Solution:
     def maxProfit(self, prices: List[int]) -> int:

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

@@ -1,6 +1,8 @@
 """
 https://leetcode.com/problems/contains-duplicate/
 """
+# - time complexity : O(n)
+# - space complexity : O(n)
 
 class Solution:
     def containsDuplicate(self, nums: List[int]) -> bool:

contains-duplicate/saysimple.py

@@ -1,11 +1,13 @@
 """
 https://leetcode.com/problems/two-sum/
 """
+# - time complexity : O(nlogn)
+# - space complexity : O(n)
 
 class Solution:
     def twoSum(self, nums: List[int], target: int) -> List[int]:
         s, e = 0, len(nums) - 1
-        arr = [[n, i] for i, n in enumerate(nums)]
+        arr = [nums[i]:=[n,i] for i, n in enumerate(nums)]
 
         arr.sort(key=lambda x: x[0])
 

two-sum/saysimple.py

@@ -1,6 +1,8 @@
 """
 https://leetcode.com/problems/valid-anagram/
 """
+# - time complexity : O(n)
+# - space complexity : O(n)
 
 from collections import Counter
 

valid-anagram/saysimple.py

@@ -1,6 +1,8 @@
 """
 https://leetcode.com/problems/valid-palindrome/
 """
+# - time complexity : O(n)
+# - space complexity : O(n)
 
 class Solution:
     def isPalindrome(self, s: str) -> bool: