【LeetCode】338. Counting Bits

问题描述

问题链接：https://leetcode.com/problems/counting-bits/#/description

Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array.

Example:

For num = 5 you should return [0,1,1,2,1,2].

Follow up:

• It is very easy to come up with a solution with run time O(n*sizeof(integer)). But can you do it in linear time O(n) /possibly in a single pass?
• Space complexity should be O(n).
• Can you do it like a boss? Do it without using any builtin function like __builtin_popcount in c++ or in any other language.

我的代码

之前用过Integer.bitCount()了，直接上代码。

public class Solution {
    public int[] countBits(int num) {
        /*
        思路很简单，直接调Integer.bitCount()就可以了
        */

        int[] bitCounts = new int[num+1];

        for(int i = 0; i <= num; i++){
            int bitCount = Integer.bitCount(i);
            bitCounts[i] = bitCount;
        }

        return bitCounts;
    }
}

我的代码打败了17.9%的Java代码。去看看讨论区。

讨论区

Three-Line Java Solution

链接地址：https://discuss.leetcode.com/topic/40162/three-line-java-solution

这个答案让我惊为天人。

An easy recurrence for this problem is f[i] = f[i / 2] + i % 2.

想想确实很有道理，如果i是偶数的话1的个数是和i/2一样多的。如果i是奇数的话，1的个数比i/2多1个。

代码如下：

public int[] countBits(int num) {
    int[] f = new int[num + 1];
    for (int i=1; i<=num; i++) f[i] = f[i >> 1] + (i & 1);
    return f;
}

How we handle this question on interview [Thinking process + DP solution]

链接地址：https://discuss.leetcode.com/topic/40195/how-we-handle-this-question-on-interview-thinking-process-dp-solution

这个也蛮有意思的，可以看看。内容太长，具体的我就不贴了。

Simple Java O(n) solution using two pointers

链接地址：https://discuss.leetcode.com/topic/41785/simple-java-o-n-solution-using-two-pointers

这个的思路也很有启发性，可以看看。