【Leetcode】Longest Substring Without Repeating Characters

/**
	**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.


	*/
	 public static int lengthOfLongestSubstring(String s) {
		 int maxLength = 0;
		 List
 
   strs = null;
		 for(int i=0;i
  
   (); char ch = s.charAt(i); strs.add(String.valueOf(ch)); for(int j=i+1;j
   
     maxLength){ maxLength = tmpMax; } } return maxLength; }