基本的代码组合
class Solution {
public int countPrimeSetBits(int L, int R) {
int count = 0;
for(int i=L;i<=R;i++){
int count1 = 0;
int tmp = i;
while(tmp>0){
if(tmp%2==1){
count1++;
}
tmp /=2;
}
if(isPrime(count1)){
count++;
}
}
return count;
}
public boolean isPrime(int num){
if(num==1) return false;
if(num==2) return true;
for(int i = 2;i<=Math.sqrt(num);i++){
if(num%i==0) return false;
}
return true;
}
}