Skip to content

Commit 25d31e6

Browse files
committed
solve: longest substring without repeating characters
1 parent 8677195 commit 25d31e6

File tree

1 file changed

+1
-1
lines changed
  • longest-substring-without-repeating-characters

1 file changed

+1
-1
lines changed

longest-substring-without-repeating-characters/wogha95.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
* right의 S만큼 순회 + left의 S만큼 순회
44
* (각 순회의 곱이 아닌 합인 이유는 right 순회 동안 left의 최대 순회가 S이기 때문입니다.)
55
*
6-
* SC: O(N)
6+
* SC: O(S)
77
* usedCharacter에 S만큼 들어갈 수 있습니다.
88
*
99
* S: s.length

0 commit comments

Comments
 (0)