首页 > 其他 > 详细

【LeetCode】Counting Bits(338)

时间:2016-04-03 10:08:42      阅读:169      评论:0      收藏:0      [点我收藏+]

1. 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].

2. Answer 

public class Solution {
    public int[] countBits(int num) {
        int[] result = new int[num + 1];
        for (int i = 1; i <= num; i++) {
            result[i] = result[i & (i - 1)] + 1;
        }
        
        return result;
    }
}

 

【LeetCode】Counting Bits(338)

原文:http://www.cnblogs.com/leesf456/p/5349083.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!