Longest Substring Without Repeating Characters(C语言实现)

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

Examples:

Given "abcabcbb", the answer is "abc", which the length is 3.

Given "bbbbb", the answer is "b", with the length of 1.

Given "pwwkew", 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.

题目地址：https://leetcode.com/problems/longest-substring-without-repeating-characters/

题目意思：给出一个字符串，输出最长的子串的长度，子串不能有重复的字符。（子串是连续的。）

解题思路：   依次读取字符串的每一个字符，如果第一次出现则当前子串长度+1，否则：首先判断当前长度是否大于最大长度，是则替换最大长度。然后

　　　　　　查找重复的字符是在原字符串哪里出现的。

代码如下：

 int lengthOfLongestSubstring(char* s) {
     ,currlen = ;
     ], i, j, start = ;
     memset(table, , sizeof(table));
     ; s[i] != '\0'; ++i){
          ){
             if (currlen > maxlen){
                 maxlen = currlen;
             }
             for(j = start; j < i; ++j){ //start记录重复的字符后一个位置
                 if (s[j] == s[i]){
                     table[s[j]] = ;
                     start = j+;
                     break;
                 }else{
                     --currlen;
                     table[s[j]] = ;
                 }
             }
         }else{
             ++currlen;
         }
     }
     if (currlen > maxlen){
         maxlen = currlen;
     }
     return maxlen;
 }