LeetCode3.lengthOfLongestSubstring

找给定字符串中最大的不同字符的子串

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 asubstring, "pwke" is a subsequence and not a substring.

/*time:2016-7-28 15:50:05
 * location:home
 * */
import java.util.HashMap;


public class Solution3 {
	public static int lengthOfLongestSubstring(String s){
		if(s.length() == 0){
			return 0;
		}
		
		int max = 0;
		HashMap map = new HashMap();
		for(int i=0,j=0; i