1012. Complement of Base 10 Integer - notruilin/LeetCode GitHub Wiki

1. Find the value of the i-th bit:

    (N >> (i-1)) & 1

2. N = 10101, X = 11111, ans = X - N = 01010 Calculate X:

    int X = 1;
    while (X < N) {
        X = X << 1 | 1;
    }