@@ -0,0 +1,500 @@
+class Solution %7B%0A    public int lengthOfLongestSubstring(String s) %7B%0A       %0A        char%5B%5D c = s.toCharArray();%0A        Map%3CCharacter, Integer%3E map = new HashMap%3C%3E();%0A        %0A        int max = 0;%0A        int j = 0;%0A        %0A        for (int i = 0; i %3C s.length(); i++) %7B%0A            if (map.containsKey(c%5Bi%5D)) %7B%0A                j = Math.max(j, map.get(c%5Bi%5D) + 1);%0A            %7D%0A            map.put(c%5Bi%5D, i);%0A            max = Math.max(max, i - j + 1);%0A        %7D%0A        %0A        return max;%0A    %7D%0A%7D

add no.3