Fix Longest Increasing Subsequence Solution

jinbeom · jinbeom · commit 1733a8105c26 · 2024-09-20T23:45:00.000+09:00
diff --git a/longest-increasing-subsequence/kayden.py b/longest-increasing-subsequence/kayden.py
@@ -1,4 +1,4 @@
-# 시간복잡도: O(N)
+# 시간복잡도: O(NlogN)
 # 공간복잡도: O(N)
 from bisect import bisect_left
 

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-# 시간복잡도: O(N)`
	`1`	`+# 시간복잡도: O(NlogN)`
`2`	`2`	`# 공간복잡도: O(N)`
`3`	`3`	`from bisect import bisect_left`
`4`	`4`