Complement of Base 10 Integer

class Solution {
public:
    int bitwiseComplement(int n) {
        if (n == 0) return 1;
        unsigned mask = 1;
        while (mask <= (unsigned)n) mask <<= 1;
        return (int)((mask - 1) ^ (unsigned)n);
    }
};

func bitwiseComplement(n int) int {
    if n == 0 {
        return 1
    }
    mask := uint(1)
    for mask <= uint(n) {
        mask <<= 1
    }
    return int((mask - 1) ^ uint(n))
}

class Solution:
    def bitwiseComplement(self, n: int) -> int:
        if n == 0:
            return 1
        mask = 1
        while mask <= n:
            mask <<= 1
        return (mask - 1) ^ n

function bitwiseComplement(n) {
    if (n === 0) return 1;
    let mask = 1;
    while (mask <= n) mask <<= 1;
    return (mask - 1) ^ n;
}

class Solution {
    public int bitwiseComplement(int n) {
        if (n == 0) return 1;
        long mask = 1;
        while (mask <= n) mask <<= 1;
        return (int) ((mask - 1) ^ n);
    }
}

function bitwiseComplement(n: number): number {
    if (n === 0) return 1;
    let mask = 1;
    while (mask <= n) mask <<= 1;
    return (mask - 1) ^ n;
}