lintcode-easy-Flip Bits

Determine the number of bits required to flip if you want to convert integer n to integer m.

Example

Given n =

31

(11111), m =

14

(01110), return

2

.

Note

Both n and m are 32-bit integers.

class Solution {
/**
*@param a, b: Two integer
*return: An integer
*/
public static int bitSwapRequired(int a, int b) {
// write your code here
int count = 0;

for(int i = 0; i < 32; i++){
int num1 = (a >> i) & 1;
int num2 = (b >> i) & 1;

if(num1 != num2)
count++;
}

return count;
}
};