@@ -0,0 +1,854 @@
+/**%0A *Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.%0A *%0A *Note:%0A *The given integer is guaranteed to fit within the range of a 32-bit signed integer.%0A *You could assume no leading zero bit in the integer%E2%80%99s binary representation.%0A *Example 1:%0A *Input: 5%0A *Output: 2%0A *Explanation: The binary representation of 5 is 101 (no leading zero bits), and its complement is 010. So you need to output 2.%0A *Example 2:%0A *Input: 1%0A *Output: 0%0A *Explanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to outp%0A */%0Aclass Solution %7B%0A    public int findComplement(int num) %7B%0A        String binary = Integer.toBinaryString(num);%0A        return Integer.parseInt(binary.replace(%220%22, %222%22).replace(%221%22, %220%22).replace(%222%22, %221%22), 2);%0A    %7D%0A%7D%0A

Create NumberComplement.java