HammingDistance.js

// Source : https://leetcode.com/problems/hamming-distance
// Author : Dean Shi
// Date   : 2017-07-10

/***************************************************************************************
 *
 * The Hamming distance between two integers is the number of positions at which the
 * corresponding bits are different.
 *
 * Given two integers x and y, calculate the Hamming distance.
 *
 * Note:
 * 0 &le; x, y < 231.
 *
 * Example:
 *
 * Input: x = 1, y = 4
 *
 * Output: 2
 *
 * Explanation:
 * 1   (0 0 0 1)
 * 4   (0 1 0 0)
 *        ?   ?
 *
 * The above arrows point to positions where the corresponding bits are different.
 *
 *
 ***************************************************************************************/

/**
 * @param {number} x
 * @param {number} y
 * @return {number}
 */
var hammingDistance = function(x, y) {
    let val = x ^ y, result = 0

    while (val) {
        ++result
        val &= val - 1
    }

    return result
};