@@ -0,0 +1,1069 @@
+package leetcode.add_binary;%0A%0Apublic class Solution %7B%0A    public String addBinary(String a, String b) %7B%0A    %09if(a == null) a = %22%22;%0A    %09if(b == null) b = %22%22;%0A        char%5B%5D ca = a.toCharArray();%0A        char%5B%5D cb = b.toCharArray();%0A        char%5B%5D ans = new char%5BMath.max(ca.length, cb.length) + 1%5D;%0A        int l_ca = ca.length;%0A        int l_cb = cb.length;%0A        int l_ans = ans.length;%0A        int carry = 0;%0A        for(int i = 0; i %3C l_ans; i++)%7B%0A        %09int va = 0, vb = 0;%0A        %09if(i %3C l_ca)%7B%0A        %09%09va = ca%5Bl_ca - 1 - i%5D == '1' ? 1 : 0;%0A        %09%7D%0A        %09if(i %3C l_cb)%7B%0A        %09%09vb = cb%5Bl_cb - 1 - i%5D == '1' ? 1 : 0;%0A        %09%7D%0A        %09ans%5Bl_ans - 1 - i%5D = (carry + va + vb) %25 2 == 0 ? '0' : '1';%0A        %09carry = (va + vb + carry) / 2;%0A        %7D%0A        int start;%0A        for(start = 0; start %3C l_ans - 1 && ans%5Bstart%5D == '0'; start++) System.err.println(ans%5Bstart%5D);%0A        return new String(ans, start, l_ans - start);%0A    %7D%0A    %0A    public static void main(String%5B%5D args)%7B%0A    %09System.err.println(new Solution().addBinary(%2211%22, %221%22));%0A    %7D%0A%7D%0A

Add java solution for 67. Add Binary