LeetCode- 476 Number Complement(easy)
2017-08-21 15:45
337 查看
题目:
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: 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.
代码:
1 class Solution { 2 public: 3 int findComplement(int num) { 4 int x = 0, p = 0; 5 while(num){ 6 if(num%2==0) x |= (1 << p); 7 ++p; 8 num/=2; 9 } 10 return x; 11 } 12 };
相关文章推荐
- LeetCode 476 Number Complement(位运算)
- LeetCode 476 Number Complement 补数
- LeetCode 476 Number Complement
- leetcode-476- Number Complement
- 刷题的日常[Leetcode]——461)Hamming Distance and 476)Number complement
- leetcode--476--Number Complement(我的解法)
- LeetCode(476): Number Complement
- leetcode 476 Number Complement
- leetcode 476 Number Complement C++
- LeetCode-476 Number Complement
- 【LeetCode】476 Number Complement
- LeetCode_476-Number Complement
- leetcode 476 Number Complement
- 476. Number Complement
- 476. Number Complement
- 476. Number Complement
- Leetcode 374. Guess Number Higher or Lower (Easy) (cpp)
- 476. Number Complement
- 476. Number Complement
- 476. Number Complement