Hamming Distance Solutions in Go

Number 461

Difficulty Easy

Acceptance 72.8%

Other languages —

Solutions

Go solution by halfrost/LeetCode-Go

package leetcode

func hammingDistance(x int, y int) int {
	distance := 0
	for xor := x ^ y; xor != 0; xor &= (xor - 1) {
		distance++
	}
	return distance
}

package leetcode

func hammingDistance(x int, y int) int {
	distance := 0
	for xor := x ^ y; xor != 0; xor &= (xor - 1) {
		distance++
	}
	return distance
}