forked from luliyucoordinate/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path0003.cpp
36 lines (34 loc) · 789 Bytes
/
0003.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
class Solution {
public:
int lengthOfLongestSubstring(string s)
{
int l = 0;
int r = 0;
int maxLength = 0;
int usedChar[256] = { 0 };
while (l < s.size())
{
if (r < s.size() && usedChar[s[r]] == 0)
{
usedChar[s[r++]] += 1;
}
else
{
usedChar[s[l++]] -= 1;
}
maxLength = max(maxLength, r - l);
}
return maxLength;
}
};
int main()
{
string s = "abcabcbb";
cout << Solution().lengthOfLongestSubstring(s) << endl;
return 0;
}