package com.fishercoder.solutions;

import java.util.ArrayList;
import java.util.List;

/**
 * 1009. Complement of Base 10 Integer
 *
 * Every non-negative integer N has a binary representation.
 * For example, 5 can be represented as "101" in binary,
 * 11 as "1011" in binary, and so on.
 *
 * Note that except for N = 0, there are no leading zeroes in any binary representation.
 *
 * The complement of a binary representation is the number in binary you get when
 * changing every 1 to a 0 and 0 to a 1.  For example, the complement of "101" in binary is "010" in binary.
 *
 * For a given number N in base-10, return the complement of it's binary representation as a base-10 integer.
 *
 * Example 1:
 * Input: 5
 * Output: 2
 * Explanation: 5 is "101" in binary, with complement "010" in binary, which is 2 in base-10.
 *
 * Example 2:
 * Input: 7
 * Output: 0
 * Explanation: 7 is "111" in binary, with complement "000" in binary, which is 0 in base-10.
 *
 * Example 3:
 * Input: 10
 * Output: 5
 * Explanation: 10 is "1010" in binary, with complement "0101" in binary, which is 5 in base-10.
 *
 * Note:
 * 0 <= N < 10^9
 * */
public class _1009 {
    public static class Solution1 {
        public int bitwiseComplement(int N) {
            if (N == 0) {
                return 1;
            }
            List<Integer> list = new ArrayList<>();
            while (N != 0) {
                list.add(N & 1);
                N >>= 1;
            }
            int result = 0;
            int exp = list.size() - 1;
            for (int i = list.size() - 1; i >= 0; i--) {
                if (list.get(i) == 0) {
                    result += Math.pow(2, exp);
                }
                exp--;
            }
            return result;
        }
    }
}

@@ -85,1056 +85,8 @@
 t;%0A%0A
-/**%0A * 1009. Complement of Base 10 Integer%0A *%0A * Every non-negative integer N has a binary representation.%0A * For example, 5 can be represented as %22101%22 in binary,%0A * 11 as %221011%22 in binary, and so on.%0A *%0A * Note that except for N = 0, there are no leading zeroes in any binary representation.%0A *%0A * The complement of a binary representation is the number in binary you get when%0A * changing every 1 to a 0 and 0 to a 1.  For example, the complement of %22101%22 in binary is %22010%22 in binary.%0A *%0A * For a given number N in base-10, return the complement of it's binary representation as a base-10 integer.%0A *%0A * Example 1:%0A * Input: 5%0A * Output: 2%0A * Explanation: 5 is %22101%22 in binary, with complement %22010%22 in binary, which is 2 in base-10.%0A *%0A * Example 2:%0A * Input: 7%0A * Output: 0%0A * Explanation: 7 is %22111%22 in binary, with complement %22000%22 in binary, which is 0 in base-10.%0A *%0A * Example 3:%0A * Input: 10%0A * Output: 5%0A * Explanation: 10 is %221010%22 in binary, with complement %220101%22 in binary, which is 5 in base-10.%0A *%0A * Note:%0A * 0 %3C= N %3C 10%5E9%0A * */%0A
 publ

refactor 1009