[LintCode] Flip Bits

Posted 2020-10-14 Push your limit!

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了[LintCode] Flip Bits相关的知识，希望对你有一定的参考价值。

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

Both n and m are 32-bit integers.

Example

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

 1 class Solution {
 2     /**
 3      *@param a, b: Two integer
 4      *return: An integer
 5      */
 6     public static int bitSwapRequired(int a, int b) {
 7         int cnt = 0;
 8         for(int i = 0; i < Integer.SIZE; i++){
 9             if(((a >>> i) & 1) != ((b >>> i) & 1)){
10                 cnt++;
11             }
12         }
13         return cnt;
14     }
15 }