476. 数字的补数

class Solution {
    public int findComplement(int num) {
        int result=0;
        int b=0;
        int c=0;
        int n=1;
        while(num/2!=0)
        {
            b=num%2;
            c=1-b;
            result+=c*n;
            n=n*2;
            num=num/2;
        }
        return result;
    }
}

class Solution {
    public int findComplement(int num) {
        int result=0;
        int b=0;
        int c=0;
        int i=0;
        int[] w=new int[32];
        while(num/2!=0)
        {
            b=num%2;
            w[i]=b;
            i++;
            num=num/2;
        }
        if(num==1)
        {
            w[i]=1;
            i++;
        }
        int j=0;
        result=1-w[0];
        int n=1;
        for(j=1;j<i;j++)
        {
            n=n*2;
            w[j]=1-w[j];
            result=result+w[j]*n;
        }
        return result;
    }
}