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. //即是查找连续出现的没有重复出现的最长子串

      

public class LongestSubstring {
  public
  int lengthOfLongestSubstring(String s) {  
         if( s.length()== 0) return 0; 
       
        int MAX_LEN=256;
        char flag[]=new char[MAX_LEN]; 
        reset(flag, MAX_LEN);  
          
       int max = 0; 
        int longest = 0; 
        int start = 0; 
     for(int i=0; i<s.length(); i++) { 
            if( flag[ s.charAt(i)] == -1 ){ 
                  longest++;    //没有重复出现的最大的子串
              } else {  //出现了子串中出现的字符

                 max = max < longest ? longest : max;            //将该子串的长度记录下来      

               for(int j=start; j<i; j++){ 
                      flag[ s.charAt(j)] = (char) -1;  //查找该字符出现的位置，并把该字符之前的位置为没有出现过
                    if( s.charAt(j) == s.charAt(i) ) { 
                         start = j + 1;                         //找到该位置，并把该位置之后的位置作为起始位置
                         System.out.println(start);
                          break; 
                    }   
                } 
                 longest = i - start + 1;   //记录修改后的最长子串
                 System.out.println("longest="+longest);
               
                  
            } 
              
              flag[ s.charAt(i)] = 1; 
              
         } 
        max = max < longest ? longest : max; 
         return max; 
     } 
       
  private
      void reset(char a[], int n){ 
          for(int i=0; i<n; i++) { 
              a[i] = (char) -1; 
          } 
      }  
  public static void main(String[]args){
   LongestSubstring lb=new LongestSubstring();
   int len=lb.lengthOfLongestSubstring("abcabdbb");
   System.out.println(len);
  }

  
}