• 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

    Prime Number of Set Bits in Binary Representation

    less than 1 minute read

    <-E 762> Prime Number of Set Bits in Binary Representation

    class Solution {
    public:
        int countPrimeSetBits(int L, int R) {
            int res = 0;
            for (int num = L; num <= R; num++) {
                int cnt = __builtin_popcount(num);
                res += cnt < 4 ? cnt > 1 : (cnt % 2 && cnt % 3);
            }
            return res;
        }
    };
    

    Tags: Algorithms, C++, Leetcode

    Updated: December 5, 2020

    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.