We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 2ef7791 commit 9869f6bCopy full SHA for 9869f6b
longest-substring-without-repeating-characters/yeonguchoe.cpp
@@ -0,0 +1,27 @@
1
+class Solution {
2
+public:
3
+ int lengthOfLongestSubstring(string s) {
4
+
5
+ int current_max = 0;
6
+ int pivot = 0;
7
+ int checker = 0;
8
9
+ int current_length = 0;
10
+ while (pivot < s.size()) {
11
+ set<char> included;
12
+ included.insert(s[pivot]);
13
+ checker = pivot + 1;
14
+ while (checker < s.size() and
15
+ included.find(s[checker]) == included.end()) {
16
+ included.insert(s[checker]);
17
+ checker += 1;
18
+ }
19
+ current_length = checker - pivot;
20
+ current_max = max(current_max, current_length);
21
+ pivot += 1;
22
23
+ return current_max;
24
25
+ // 시간 복잡도: O(n)
26
+ // 공간 복잡도: O(n)
27
+};
0 commit comments