3. Longest Substring Without Repeating Characters

Given a string, find the length of the longest substring without repeating characters.

Example 1:

Input: "abcabcbb"
Output: 3 
Explanation: The answer is "abc", which the length is 3.

Example 2:

Input: "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.

Example 3:

Input: "pwwkew"
Output: 3
Explanation: The answer is "wke", with the length of 3. 
Note that the answer must be a substring, "pwke" is a subsequence and not a substring.

【题意】

给一个string，找出其中不含重复的字符的最长subString。

【思路】

记录当前string为cur，如果下一个char出现在cur中，则从出现处截断，新的cur = 截断后cur + ch；如果未出现，说明不重复，则新的cur += ch。记录cur最大的数组。

时间O(n2)？，空间O(1)。

【代码】

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        string cur = "";
        int maxLen = 0;
        for(int i=0; i<s.size(); i++){
            string tmp = getStr(cur, s[i]);
            cur = tmp + s[i];
            if(cur.size() > maxLen)
                maxLen = cur.size();
        }
        return maxLen;
    }
    
    string getStr(string cur, char ch){
        string str = "";
        bool isExist = false;
        for(int i=0; i<cur.size(); i++){
            if(ch == cur[i]){
                isExist = true;
                continue;
            }
            if(isExist) str += cur[i];
        }
        if(!isExist) str = cur;
        return str;
    }
};