Leetcode 3. Longest Substring Without Repeating Characters

本文首发于每日一题：3 - 咸鱼Blog
Given a string s, find the length of the longest substring without repeating characters.

Example 1

 Input: s = "abcabcbb"
 Output: 3
 Explanation: The answer is "abc", with the length of 3.

Example 2

 Input: s = "bbbbb"
 Output: 1
 Explanation: The answer is "b", with the length of 1.

Example 3

 Input: s = "pwwkew"
 Output: 3
 Explanation: The answer is "wke", with the length of 3.
 Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.

Constraints

• 

• s consists of English letters, digits, symbols and spaces

Solution code

int find(char x,char *s,int start,int end){
     int ret=-1;
     for(int i=start;i<=end;i++){
         if(x==s[i]){
             ret=i;
             break;
         }
     }
     return ret;
 }
 int lengthOfLongestSubstring(char * s){
     int length=0;
     int temp=0;
     int a=0,b=0;
     while(b<strlen(s)){
         b++;
         if(find(s[b],s,a,b-1)==-1){
             temp=b-a;
             length=(temp>length)?temp:length;
         }
         else{
             temp=b-a;
             a=1+find(s[b],s,a,b-1);
             length=(temp>length)?temp:length;
         }
     }
     return length;
 }

Note:

1. 从前往后依次读入一个字符，判断标定的字符串内是否存在该字符；

2. 不存在则当前长度增加，与记录的最长长度比较，更新最长长度；

3. 存在则移动标定字符串的头，直到不存在重复，更新当前长度和最长长度；

4. 标定字符串尾到达总字符串尾部，结束；

5. 每读入一个字符都要对前面进行搜索，故时间复杂度为O(N^2)