[leetcode]Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters

 

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

the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", 

with the length of 1.

解题思路：申请256个空间的整型数组用来标记字符串中元素的下标，并且全部初始化为-1，将第一个元素的下标初始化为0，

bIndex表示在此之前的下标均已无效，即可以被更改，我们每次用当前下标与bIndex作差于当前最长的不同字符的串进行比较取最大的，

如果当前下标的元素与下标为bindex至当前元素之间的元素有重复，则计算取得最大的长度后，

要将bindex置为当前元素的未改动前的元素下标的下一个，然后再将当前元素下标改为当前的下标值。

    int lengthOfLongestSubstring(string s) {
        size_t slen = s.size();
        
        if(0 == slen) return 0;
        
        int maxLen = 1;
        int bIndex = 0;
        int sIndex[256];
        
        for(int i = 0; i < 256; i++) sIndex[i] = -1;
        sIndex[s[0]] = 0;
        for(int i = 1; i < slen; i++){
            if(sIndex[s[i]] < bIndex){ //下标数组中的元素下标失效
                maxLen = max(maxLen, i - bIndex + 1);
                sIndex[s[i]] = i;
            }else{
                maxLen = max(maxLen, i - sIndex[s[i]]); //下标数组中元素的下标与bindex到i中的元素有重复
                bIndex = sIndex[s[i]] + 1;
                sIndex[s[i]] = i;
            }
            
        }
        
        return maxLen;
    }