题目大意:给你一个正整数,输出和它互补的数(翻转所有的bits)。
Problem:
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:
1 2 3 |
Input: 5 Output: 2 Explanation: The binary representation of 5 is 101 (no leading zero bits), and its complement is 010. So you need to output 2. |
Example 2:
1 2 3 |
Input: 1 Output: 0 Explanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to output 0. |
Idea:
Bit
Solution:
C++
1 2 3 4 5 6 7 8 9 10 |
// Author: Huahua // Running time: 3 ms class Solution { public: int findComplement(int num) { int mask = ~0; while (num & mask) mask <<= 1; return ~num ^ mask; } }; |
请尊重作者的劳动成果,转载请注明出处!花花保留对文章/视频的所有权利。
如果您喜欢这篇文章/视频,欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
Be First to Comment