Swift 汉明距离 - LeetCode

输入: x = 1, y = 4

输出: 2

解释:
1   (0 0 0 1)
4   (0 1 0 0)
       ↑   ↑

上面的箭头指出了对应二进制位不同的位置。

func hammingDistance(_ x: Int, _ y: Int) -> Int {
    
    //初始化两个空数组来装各自对应的二进制
    var dicX = [Int]()
    var dicY = [Int]()
   
    //将x,y改成可变的
    var x = x
    var y = y
    
    if (x == 0) {
        dicX.append(0)
    }
    if (y == 0) {
        dicY.append(0)
    }
    
   //对2求余将10进制转换为2进制
    while x != 0 {
        dicX.append(x%2)
        x /= 2
    }
    
    while y != 0 {
        dicY.append(y%2)
        y /= 2
    }

    print(dicX)
    print(dicY)
    
    //区分长短是为了方便后面对比
    let short = dicX.count <= dicY.count ? dicX:dicY
    let long  = dicX.count <= dicY.count ? dicY:dicX
    
    var count = 0
    var index = 0
    //一一对比
    for i in 0..<short.count {
        if short[i] != long[i] {
            count += 1
        }
        index = i
    }
    // 统计长的数组中 长出来那部分的1的个数
    if long.count > short.count {
        for i in index+1..<long.count {
            if long[i] == 1 {
                count += 1
            }
        }
    }
   
    return count
}

func hammingDistance(_ x: Int, _ y: Int) -> Int {
    
    var num : Int = x ^ y
    var sum : Int = 0
    
    while (num > 0) {
        sum += num & 1 == 1 ? 1 : 0
        num = num >> 1
    }
    return sum
}