Leetcode 476. Number Complement

public class Solution {    public int findComplement(int num) {        int res = 0;        int carry = 1;        while (num > 0) {            int temp = (num%2 == 0) ? 1 : 0;            res += temp*carry;            carry *= 2;            num /= 2;        }        return res;    }}