[leetcode] 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.

用一个数组存储出现过的数字，两个指针分别遍历数组，当出现相同是，前一个指针后移直到消除重复，统计两个指针距离的最大值即为所求

代码：

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        int len=s.size();
        if(len==0) return 0;
        int hasFind[255]={0};
        int longest=0;
        for(int i=0,j=0;j<len;j++){
            while(hasFind[s[j]]==1){
                hasFind[s[i]]=0;
                i++;
            }
            hasFind[s[j]]=1;
            longest=max(longest,j-i+1);
        }
        return longest;
    }
};