zoukankan      html  css  js  c++  java
  • 477. Total Hamming Distance

    Problem:

    The Hamming distance between two integers is the number of positions at which the corresponding bits are different.

    Now your job is to find the total Hamming distance between all pairs of the given numbers.

    Example:

    Input: 4, 14, 2
    
    Output: 6
    
    Explanation: In binary representation, the 4 is 0100, 14 is 1110, and 2 is 0010 (just
    showing the four bits relevant in this case). So the answer will be:
    HammingDistance(4, 14) + HammingDistance(4, 2) + HammingDistance(14, 2) = 2 + 2 + 2 = 6.
    

    Note:

    Elements of the given array are in the range of 0 to 10^9
    Length of the array will not exceed 10^4.
    

    思路

    Solution (C++):

    int totalHammingDistance(vector<int>& nums) {
        int n = nums.size(), res = 0;
        if (n < 2)  return 0;
        vector<int> diff(2, 0);
        
        while (true) {
            int count = 0;
            diff[0] = 0;
            diff[1] = 0;
            
            for (int i = 0; i < n; ++i) {
                if (nums[i] == 0)  ++count;
                ++diff[nums[i]%2];
                nums[i] >>= 1;
            }
            res += (diff[0] * diff[1]);
            
            if (count == n)  return res;
        }
    }
    

    性能

    Runtime: 80 ms  Memory Usage: 8.2 MB

    思路

    Solution (C++):

    
    

    性能

    Runtime: ms  Memory Usage: MB

    相关链接如下:

    知乎:littledy

    欢迎关注个人微信公众号:小邓杂谈,扫描下方二维码即可

    作者:littledy
    本文版权归作者和博客园共有,欢迎转载,但未经作者同意必须保留此段声明,且在文章页面明显位置给出原文链接,否则保留追究法律责任的权利。
  • 相关阅读:
    JDK的KeyTool和KeyStore等加密相关
    关于分布式事务的随笔[待续]
    Netty实例几则
    Disruptor快速入门
    Java获取系统环境信息
    JDK的BIO, NIO, AIO
    四种常用IO模型
    JDK的多线程与并发库
    递归转换为迭代的一种通用方式
    二叉树的java实现
  • 原文地址:https://www.cnblogs.com/dysjtu1995/p/12690411.html
Copyright © 2011-2022 走看看