@@ -0,0 +1,843 @@
+package leetcode.isomorphic_strings;%0A%0Apublic class Solution %7B%0A    public boolean isIsomorphic(String s, String t) %7B%0A        int idx;%0A        %0A        int%5B%5D charMapS = new int%5B128%5D;%0A        int%5B%5D codeS = new int%5Bs.length()%5D;%0A        char%5B%5D charS = s.toCharArray();%0A        idx = 0;%0A        for(int i = 0; i %3C charS.length; i++)%7B%0A            char c = charS%5Bi%5D;%0A            if(charMapS%5Bc%5D == 0)%7B%0A                charMapS%5Bc%5D = ++idx;%0A            %7D%0A            codeS%5Bi%5D = charMapS%5Bc%5D;%0A        %7D%0A%0A        int%5B%5D charMapT = new int%5B128%5D;%0A        char%5B%5D charT = t.toCharArray();%0A        idx = 0;%0A        for(int i = 0; i %3C charT.length; i++)%7B%0A            char c = charT%5Bi%5D;%0A            if(charMapT%5Bc%5D == 0)%7B%0A                charMapT%5Bc%5D = ++idx;%0A            %7D%0A            if(codeS%5Bi%5D != charMapT%5Bc%5D) return false;%0A        %7D%0A        return true;%0A    %7D%0A%7D%0A

Add java solution for 205. Isomorphic Strings