首页 > 其他 > 详细

leetcode338

时间:2017-04-30 00:22:37      阅读:365      评论:0      收藏:0      [点我收藏+]
public class Solution {
    public int[] CountBits(int num) {
        var ary = new int[num + 1];

            for (int i = 0; i <= num; i++)
            {
                var count = 0;
                var cur = i;
                do
                {
                    var c = cur % 2;
                    if (c == 1)
                    {
                        count++;
                    }
                    cur = cur / 2;
                } while (cur != 0);

                ary[i] = count;
            }

            return ary;
    }
}

https://leetcode.com/problems/counting-bits/#/description

leetcode338

原文:http://www.cnblogs.com/asenyang/p/6786561.html

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