Saved from https://leetcode-cn.com/problems/hamming-distance/submissions/
统计二进制数有多少个1的神奇方法
func hammingDistance(x int, y int) int { z := x ^ y n := 0 for z != 0 { z &= z - 1 n++ } return n }