LeetCode题解之Hamming Distance

 1 int hammingDistance(int x, int y) {
 2         
 3         bitset<32> a(x);
 4         bitset<32> b(y);
 5         
 6         string a_s = a.to_string();
 7         string b_s = b.to_string();
 8         
 9         string::iterator it1 = a_s.begin() ;
10         string::iterator it2 = b_s.begin() ;
11         int re = 0;
12         while( it1 != a_s.end() && it2 != b_s.end() ){
13             if( *it1 != *it2 ){
14                 re++;
15             }
16             it1++;
17             it2++;
18         }
19         return re;
20     }