762. Prime Number of Set Bits in Binary Representation

最新推荐文章于 2022-07-04 19:20:58 发布

统计分析分析

最新推荐文章于 2022-07-04 19:20:58 发布

阅读量127

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_36303521/article/details/89060811

版权

leetcode 专栏收录该内容

54 篇文章 0 订阅

订阅专栏

Given two integers L and R, find the count of numbers in the range [L,
R] (inclusive) having a prime number of set bits in their binary
representation.

(Recall that the number of set bits an integer has is the number of 1s
present when written in binary. For example, 21 written in binary is
10101 which has 3 set bits. Also, 1 is not a prime.)

Example 1:

Input: L = 6, R = 10 Output: 4 Explanation: 6 -> 110 (2 set bits, 2 is
prime) 7 -> 111 (3 set bits, 3 is prime) 9 -> 1001 (2 set bits , 2 is
prime) 10->1010 (2 set bits , 2 is prime)

这个简单题

class Solution(object):
    def countPrimeSetBits(self, L, R):
        primes = {2, 3, 5, 7, 11, 13, 17, 19}
        return sum(bin(x).count('1') in primes
                   for x in range(L, R+1))