首页 > 其他 > 详细

LeetCode "Counting Bits"

时间:2016-03-21 13:55:26      阅读:93      评论:0      收藏:0      [点我收藏+]

Neat DP problem to go.

from math import *

class Solution(object):
    def countBits(self, num):
        ret = [0]
        for i in range(1, num + 1):
            if i & 1: # odd
                ret += [ret[-1] + 1]
            else:
                prev = i - 1    
                trailing1s = (i | prev) - i
                cnt = int(math.log(trailing1s + 1, 2))
                ret += [ret[-1] + 1 - cnt]
        return ret

If you don‘t like log(), you can use lookup table.

LeetCode "Counting Bits"

原文:http://www.cnblogs.com/tonix/p/5301327.html

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