Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary rePResentation.
Note: The given integer is guaranteed to fit within the range of a 32-bit signed integer. You could assume no leading zero bit in the integer’s binary representation. Example 1:
Input: 5Output: 2Explanation: The binary representation of 5 is 101 (no leading zero bits), and its complement is 010. So you need to output 2.Example 2:
Input: 1Output: 0Explanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to output 0.class Solution {public: int findComplement(int num) { long long mode = 1; int ans = num; while(num){ mode <<= 1; num >>= 1; } --mode; ans ^= mode; return ans; }};新闻热点
疑难解答
