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) {        int temp=0, i=0;        while(num!=0){            if(num%2==0)               temp+=pow(2,i);            num/=2;            i++;        }        return temp;    }};