Lintcode: Flip Bits

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

Have you met this question in a real interview? Yes
Example
Given n = 31 (11111), m = 14 (01110), return 2.

Note
Both n and m are 32-bit integers.

This is to test XOR(called: exclusive or)

Notice "=="'s order higher than "&"

class Solution {
    /**
     *@param a, b: Two integer
     *return: An integer
     */
    public static int bitSwapRequired(int a, int b) {
        // write your code here
        int res = 0;
        int xor = a ^ b;
        for (int i=0; i<32; i++) {
            if (((xor>>i)&1) == 1)
                res++;
        }
        return res;
    }
};