@@ -0,0 +1,591 @@
+public class Solution %7B%0A    public int lengthOfLongestSubstring(String s) %7B%0A        if (s.length() %3C 2) return s.length();%0A%0A        Map%3CCharacter, Integer%3E map = new HashMap%3CCharacter, Integer%3E();%0A        int max, count;%0A        max = count = 0;%0A        %0A        for (int i = 0; i %3C s.length(); i++) %7B%0A            char c = s.charAt(i);%0A            if (!map.containsKey(c) %7C%7C map.get(c) %3C i - count)%0A                count++;%0A            else%0A                count = i - map.get(c);%0A            map.put(c, i);%0A            if (count %3E max)    max = count;%0A        %7D%0A        return max;%0A    %7D%0A%7D%0A

Create 003.java