3. Longest Substring Without Repeating Characters

解題思路

two pointer 的概念來解。

不知為何卡好久，要找時間再寫一次。

程式碼

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        int index[128];
        int left = 0, right = 0, maxLen = 0;

        for(int i=0; i<128; i++)
            index[i] = -1;
        for(int i=0; i<s.size(); i++)
        {
            right = i;
            
            left = max(left, index[s[i]] + 1);
            maxLen = max(right - left + 1, maxLen);
            index[s[i]] = right;
        }
        return maxLen;
    }
};