LeetCode: 476 Number Complement(easy)

题目：

Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.

　　　Note:

1. 1. The given integer is guaranteed to fit within the range of a 32-bit signed integer.
   2. You could assume no leading zero bit in the integer’s binary representation.

　　　Example 1:

Input:
Output:
Explanation: The binary representation of  is  (no leading zero bits), and its complement is . So you need to output .

代码：

 class Solution {
 public:
     int findComplement(int num) {
         int x = , p = ;
         while(num){
             if(num%==) x |= ( << p);
             ++p;
             num/=;
         }
         return x;
     }
 };