181. Flip Bits "Lintcode, by Java"

Description

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

Both n and m are 32-bit integers.

Example

Given N = 31 (11111), m = 14 (01110), return 2 .

Problem solving: compare two integers corresponding to the binary number, the total number of different bits. Note that negative numbers are also included. The ">>>" moves to the right without a sign and is padded with 0.

1  Public classSolution {2     /**3      * @paramA:an integer4      * @paramB:an integer5      * @return: An integer6      */7      Public intBitswaprequired (intAintb) {8         //Write your code here9         intCount = 0; Ten          for(intc = a ^ b; c! = 0; c = C >>> 1) { OneCount + = C & 1; A         } -         returncount; -     } the}

181. Flip Bits "Lintcode, by Java"