//url:https://leetcode.com/problems/number-complement/description/

class Solution {
public:
    int findComplement(int num) {
        int x=1;
        int sum=x;
        while(sum