class Solution {
private:
bool canUse[256];
public:
int lengthOfLongestSubstring(string s) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (s.size() <2) {
return s.size();
}
int max = INT_MIN;
map<int, int> mymap;
mymap[s[0]] = 1;
int temp = 1;
for (int i = 1; i<s.size(); i++) {
if (mymap[s[i]] == 0) {
mymap[s[i]] = i+1;
temp++;
}
else {
if (temp >= max) {
max=temp;
}
temp = 1;
i = mymap[s[i]];
mymap.clear();
mymap[s[i]]=i+1;
}
if (temp >= max) {
max=temp;
}
}
return max;
}
};
private:
bool canUse[256];
public:
int lengthOfLongestSubstring(string s) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (s.size() <2) {
return s.size();
}
int max = INT_MIN;
map<int, int> mymap;
mymap[s[0]] = 1;
int temp = 1;
for (int i = 1; i<s.size(); i++) {
if (mymap[s[i]] == 0) {
mymap[s[i]] = i+1;
temp++;
}
else {
if (temp >= max) {
max=temp;
}
temp = 1;
i = mymap[s[i]];
mymap.clear();
mymap[s[i]]=i+1;
}
if (temp >= max) {
max=temp;
}
}
return max;
}
};