Leetcode学习笔记:#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.
实现:
public int bitwiseComplement(int N) {
int X = 1;
while (N > X) X = X * 2 + 1;
return X - N;
}
此题不会,二进制