338. Counting Bits比特位计数

class Solution {
    public int[] countBits(int num) {
        int[] dp = new int[num+1];
        dp[0] = 0;
        for(int i = 1; i <= num; i++) {
            dp[i] = dp[i/2] + i%2;
        }
        return dp;
    }
}

你可能感兴趣的:(leetcode,动态规划,位运算)