Leetcode 762: 二进制表示中质数个计算置位

#include <iostream>
#include <vector>
#include <map>
#include <cmath>
using namespace std;

class Prime{
    map<int,bool> store;
public:
    Prime(){
        store[2]=true;
        store[3]=true;
    }
    bool judge(int v){
        if(v<2){
            return false;
        }
        if(store.find(v)!=store.end()){
            return true;
        }
        for(int i=2;i<=sqrt(v);i++){
            if(v%i==0){
                return false;
            }
        }
        store[v] = true;
        return true;
    }
};

class Solution {
public:
    int calculate_one(int v){
        int max_2 = log2(v);
        int val = pow(2,max_2);
        int count = 0;
        for(int i=max_2;i>=0;i--){
            if(v>=val){
                v-=val;
                count++;
            }
            val/=2;
        }
        return count;
    }

    int countPrimeSetBits(int left, int right) {
        int count = 0;
        Prime prime;
        for(int i=left;i<=right;i++){
            int val = this->calculate_one(i);
            if(prime.judge(val)){
                count++;
            }
        }
        return count;
    }
};

int main(void){
    Solution s;
    cout<<s.countPrimeSetBits(10,15)<<endl;
    return 0;
}