How many bits are there in the binary of two digits for a bitwise operation? different __ Binary

Problem Description:

There are 10 kinds of people in the world, one knows the binary system, one does not understand. So you know the binary expression of two int32 integers m and n, how many bits are different?

Enter an example:

1999 2299

Output Example:

7

My Code:

/** * The number of
	 different digits in the binary of two numbers
	 * @param m 
	 * @param n
	 * @return Returns the number of different digits/public
	static int Countbitdiff (int m, int n) {
		//XOR or
		int ans = m^n;
		Find the number of 1 in ans
		int count = 0;
		while (ans!= 0) {
			ans &= (ans-1);
			count++;
		}
		return count;
    }

Pay attention to how to find a number of 1 in a binary system through this problem.