@@ -0,0 +1,645 @@
+class Solution %7B%0A    public int singleNumber(int%5B%5D nums) %7B%0A        int%5B%5D bit = new int%5B32%5D;%0A        for (int i=0; i%3Cnums.length; i++) %7B%0A            for (int j=0; j%3Cbit.length; j++) %7B%0A                bit%5Bj%5D += (nums%5Bi%5D%3E%3Ej) & 1;%0A            %7D%0A        %7D%0A        int result = 0;%0A        for (int i=0; i%3Cbit.length; i++) %7B%0A            if (bit%5Bi%5D%253 != 0) %7B%0A                result += 1 %3C%3C i;%0A            %7D%0A        %7D%0A        return result;%0A    %7D%0A%7D%0A%0Apublic class single_number_ii %7B%0A    public static void main(String%5B%5D args) %7B%0A        Solution s = new Solution();%0A        int%5B%5D a = %7B1,1,2,1,2,2,3%7D;%0A        System.out.println(s.singleNumber(a));%0A    %7D%0A%7D%0A

add https://leetcode.com/problems/single-number-ii/