中等题 leetcode 3. 无重复字符的最长子串

这里有leetcode题集分类整理！！！

我的AC代码：

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        int length = s.length();
        if(length == 0) return 0;
        int res = 1;
        int left = 0, right = 0;
        while(right < length) {
            int searchResult = Search(s[right], s, left, right);
            // 出现重复字符
            if(searchResult != -1) {
                left = searchResult + 1;
            } else {
            // 无重复字符     
                right ++ ;  
            }
            res = max(res, right - left);
        }
        return res;
    }
    int Search(char x, string s, int l, int r) {
        if(l == r) return -1;
        for(int i = l; i < r ; i ++) {
            if(x == s[i]) return i;
        }
        return -1;
    }
};

优化后的AC代码：(hash)

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        int length = s.length();
        if(length == 0) return 0;
        unordered_map<char,int> hashTable;
        int currentLength = 0, maxLength = -1;
        int startIndex = 0;
        for(int i = 0 ; i < length ; i ++) {
            // 没有出现重复字符
            if(hashTable.find(s[i]) == hashTable.end()) {
                hashTable[s[i]] = i;
                currentLength ++;
            } else {
            // 出现重复字符
                maxLength = max(maxLength, currentLength);
                startIndex = max(hashTable[s[i]], startIndex);
                currentLength = i - startIndex;
                hashTable[s[i]] = i;
            }
            maxLength = max(maxLength, currentLength);
        }
        return maxLength;
    }
};