完全平方数

#include "iostream"
#include <queue>
#include <unordered_set>
using namespace std;

class Solution{
        public:
                Solution() {};
                int numSquare(int n){
                        queue<int> q;
                        q.push(n);

                        unordered_set<int> sset;
                        sset.insert(n);
                        int count = 0;
                        while(!q.empty()){
                                cout<<"count:"<<count<<endl;
                                cout<<"q.size():"<<q.size()<<endl;
                                int s = q.size();
                                for(int i = 0; i< s; i++){
                                        int tmp = q.front();
                                        cout<<tmp<<endl;
                                        q.pop();
                                        for(int j = 1; j*j <= tmp; j++){
                                                int sub = tmp - j*j;
                                                cout<<"sub:"<<sub<<"  "<<endl;
                                                if(sub == 0) return count+1;
                                                if(sset.find(sub) == sset.end()){
                                                        sset.insert(sub);
                                                        q.push(sub);
                                                }
                                        }
                                }
                                count++;
                        }
                        return count;
                }
};

int main(){
        Solution solu;
        cout<<solu.numSquare(12)<<endl;
}