• Skip to primary navigation
  • Skip to content
  • Skip to footer
zhicheng xie's demo blog
  • Quick-Start Guide

    Your Name

    I am an amazing person.

    • Somewhere

    Counting Bits

    less than 1 minute read

    <-E 338> Counting Bits

    class Solution {
    public:
        vector<int> countBits(int n) {
            vector<int> t(n+1, 0);
            
            for(int i = 1; i <= n; ++i)
                t[i] = t[i/2] + i%2;
            
            return t;
        }
    };
    

    Tags: Algorithms, C++, Leetcode

    Updated: April 7, 2022

    Share on

    Twitter Facebook LinkedIn
    Previous Next

    You may also enjoy

    Decode Ways

    less than 1 minute read

    <-M 91> Decode Ways

    Word Break

    less than 1 minute read

    <-H 139> Word Break

    Distinct Subsequences

    less than 1 minute read

    <-H 115> Distinct Subsequences

    Edit Distance

    less than 1 minute read

    <-H 72> Edit Distance

    • Follow:
    • Feed
    © 2023 zhicheng xie's blog. Powered by Jekyll & Minimal Mistakes.