wrote Time/Space Complexities for each algorithm

wclee2265 · wclee2265 · commit 94eb325f1bae · 2024-04-25T15:26:16.000+09:00
diff --git a/best-time-to-buy-and-sell-stock/wclee2265.cpp b/best-time-to-buy-and-sell-stock/wclee2265.cpp
@@ -1,4 +1,6 @@
 // https://leetcode.com/problems/best-time-to-buy-and-sell-stock/
+// Time Complexity : O(n)
+// Space Complexity : O(1)
 
 class Solution {
 public:
diff --git a/contains-duplicate/wclee2265.cpp b/contains-duplicate/wclee2265.cpp
@@ -1,4 +1,6 @@
 // https://leetcode.com/problems/contains-duplicate/
+// Time Complexity : O(n)
+// Space Complexity : O(n)
 
 class Solution {
 public:
diff --git a/two-sum/wclee2265.cpp b/two-sum/wclee2265.cpp
@@ -1,4 +1,6 @@
 // https://leetcode.com/problems/two-sum/
+// Time Complexity : O(nlogn)
+// Space Complexity : O(n)
 
 class Solution {
 public:
diff --git a/valid-anagram/wclee2265.cpp b/valid-anagram/wclee2265.cpp
@@ -1,4 +1,6 @@
 // https://leetcode.com/problems/valid-anagram/
+// Time Complexity : O(n)
+// Space Complexity : O(1)
 
 class Solution {
 public:
diff --git a/valid-palindrome/wclee2265.cpp b/valid-palindrome/wclee2265.cpp
@@ -1,4 +1,6 @@
 // https://leetcode.com/problems/valid-palindrome/
+// Time Complexity : O(n)
+// Space Complexity : O(n)
 
 class Solution {
 public:
