第38题 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.

Hide Tags

  Hash Table Two Pointers String

Code in Java：

public class Solution {
    public int lengthOfLongestSubstring(String s) {
        
        if(s.length()==0||s.length()==1) return s.length();
        
        int result=0;
        String subS=""+s.charAt(0);
        for(int i=1; i<s.length(); i++){
            
            if(subS.indexOf(s.charAt(i))==-1){
                subS+=s.charAt(i);
            }
            else{
                 if(subS.length()>result)   result = subS.length();
                 int index = subS.indexOf(s.charAt(i));
                 subS=subS.substring(index+1);
                 i--;
            }
        }
        return Math.max(result, subS.length());
    }
}

Note：

这道题关键是只需要遍历字符串一遍。一旦发现有重复字母，找到目前substring中该重复字母出现位置，然后获得从该字母后的substring，然后继续遍历整个字符串。过程中不要出现多余的回溯和遍历。