[第二轮] 3/25-3/31 CareerCup 5.5

Write a function to determine the number of bits required to convert integer A to integer B.

EXAMPLE:
Input:31,14
Output:2

发帖规范:
http://www.1point3acres.com/bbs/thread-48094-1-1.html
http://www.1point3acres.com/bbs/thread-32423-1-1.html

通过 A & 1 得到当前数的第一位值，然后通过 A >>>= i 不断左移

https://gist.github.com/pi2e/fd3a2832a27a488d928d

int  transfer(int a, int b)
{
     int x = a ^ b;
     int n = 0;
     while (x) { n ++; x = x & (x -1) ; }
     return n;
}

异或后求bit 1的个数https://gist.github.com/Jnight/5254745

* method: 编程之美上面的方法。。先异或再找出1的个数，
https://github.com/1094401996/Ca ... NumberOfChange.java

https://gist.github.com/menmen911/8d8df71e54b43218be3b

First a^b, then count the number of 1;
https://gist.github.com/ahbbzpc/668bc467886a8e1a6ed9

https://gist.github.com/ThunderXu/5276692
Exclusive OR first and then count the number of 1(or directly count the number of different bits one by one)