762. Prime Number of Set Bits in Binary Representation
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 Example 2: Input: L = 10,R = 15 Note:
class Solution: def countPrimeSetBits(self,L,R): """ :type L: int :type R: int :rtype: int """ res = 0 for i in range(L,R+1): if bin(i).count(‘1‘) in [2,3,5,7,11,13,17,19,23]: res += 1 return res (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |