461. Hamming Distance

int hammingDistance(int x, int y) { 
    string str1 = "";       
    string str2 = "";       
    while (x > 0) { 
        int temp = x % 2;              
        x /= 2;              
        str1 += (char)temp; 
    }       
    while (y > 0) { 
        int temp = y % 2;              
        y /= 2;              
        str2 += (char)temp; 
    }       
    int Cnt = 0;       
    int n = str1.size() > str2.size() ? str1.size() : str2.size();       
    for (int i = 0; i < n; ++i) { 
        char c1 = i < str1.size() ? str1[i] : char(0);              
        char c2 = i < str2.size() ? str2[i] : char(0);              
        if (c1 != c2)++Cnt; }       return Cnt; 
}