考虑两个数字m = 65 => 01000001和n = 80 => 01010000
翻转的位数是2。
解决这个问题的方法
步骤1-将两个数字都转换为比特。
步骤2-计数位数被翻转。
package main import ( "fmt" "strconv" ) func FindBits(x, y int) int{ n := x ^ y count := 0 for ;n!=0; count++{ n = n & (n-1) } return count } func main(){ x := 65 y := 80 fmt.Printf("Binary of %d is: %s.\n", x, strconv.FormatInt(int64(x), 2)) fmt.Printf("Binary of %d is: %s.\n", y, strconv.FormatInt(int64(y), 2)) fmt.Printf("The number of bits flipped is %d\n", FindBits(x, y)) }输出结果
Binary of 65 is: 1000001. Binary of 80 is: 1010000. The number of bits flipped is 2