Longest Substring Without Repeating Characters.txt

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int mav = 0, l = 0, i = 0;
        vector<bool> use(255, false);
	    while (i < s.size()) {
		    if (!use[s[i]]) {
			    use[s[i]] = true;
			    mav = max(mav, i - l + 1);
	        } else {
			    while (s[l] != s[i])
				    use[s[l++]] = false;
	        	l++;
		    }
		    i++;
	    }
	    return mav;
    }
};