Leetcode 1009. Complement of Base 10 Integer Solution 2

class Solution {
public:
    int bitwiseComplement(int n) {
        int count=0;
        int temp=n;
        if(n==0){
        return 1;
    }
    while(temp!=0){
        count++;
        temp=temp>>1;
    }
    temp=pow(2,count)-1;
    return temp-n;
    }
    
};