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) Example 2:
Input: L = 10, R = 15 Output: 5 Explanation: 10 -> 1010 (2 set bits, 2 is prime) 11 -> 1011 (3 set bits, 3 is prime) 12 -> 1100 (2 set bits, 2 is prime) 13 -> 1101 (3 set bits, 3 is prime) 14 -> 1110 (3 set bits, 3 is prime) 15 -> 1111 (4 set bits, 4 is not prime) Note:
L, R will be integers L <= R in the range [1, 10^6]. R - L will be at most 10000.
public class Solution {
public int CountPrimeSetBits(int L, int R) {
int count=0;
var set = new HashSet<int>();
set.Add(2);
set.Add(3);
set.Add(5);
set.Add(7);
set.Add(11);
set.Add(13);
set.Add(17);
set.Add(19);
set.Add(23);
set.Add(29);
set.Add(31);
for(int i=L;i<=R;i++){
int val = SetBitCount(i);
if(set.Contains(val)){
count++;
}
}
return count;
}
private int SetBitCount(int num){
int count=0;
while(num!=0){
count+= (num&1);
num=num>>1;
}
return count;
}
}Time Complexity: O(nlogm) Where n is the number of elements and m is the count of binary bits of the number.
Space Complexity: O(1)
