docs: add time and space complexity comments to algorithms

neverlish · neverlish · commit 73af29d33988 · 2024-12-05T18:59:03.000+09:00
diff --git a/contains-duplicate/neverlish.go b/contains-duplicate/neverlish.go
@@ -1,3 +1,6 @@
+// 시간복잡도: O(n)
+// 공간복잡도: O(n)
+
 package main
 
 import "testing"
diff --git a/house-robber/neverlish.go b/house-robber/neverlish.go
@@ -1,3 +1,6 @@
+// 시간복잡도: O(n)
+// 공간복잡도: O(n)
+
 package main
 
 import (
diff --git a/longest-consecutive-sequence/neverlish.go b/longest-consecutive-sequence/neverlish.go
@@ -1,3 +1,6 @@
+// 시간복잡도: O(n)
+// 공간복잡도: O(n)
+
 package main
 
 import "testing"
diff --git a/top-k-frequent-elements/neverlish.go b/top-k-frequent-elements/neverlish.go
@@ -1,3 +1,6 @@
+// 시간복잡도: O(n)
+// 공간복잡도: O(n)
+
 package main
 
 import "testing"
diff --git a/valid-palindrome/neverlish.go b/valid-palindrome/neverlish.go
@@ -1,3 +1,6 @@
+// 시간복잡도: O(n)
+// 공간복잡도: O(n)
+
 package main
 
 import (
