classSolution{public:
vector<int>intersection(vector<int>& nums1, vector<int>& nums2){//用于存放结果
unordered_set <int> result;
int hash[1001]={0};for(int i =0; i < nums1.size(); i++){
hash[nums1[i]]=1;}for(int i =0; i < nums2.size(); i++){if(hash[nums2[i]]==1){
result.insert(nums2[i]);}}return vector<int>(result.begin(),result.end());}};
classSolution{public:
int getsum(int n){
int sum =0;while(n >0){
sum +=(n %10)*(n %10);
n = n /10;}return sum;}
bool isHappy(int n){
int slow = n,fast = n;do{
slow =getsum(slow);
fast =getsum(getsum(fast));}while(slow != fast);return slow ==1;}};
classSolution{public:
int getsum(int n){
int sum =0;while(n >0){
sum +=(n %10)*(n %10);
n = n /10;}return sum;}
bool isHappy(int n){
unordered_set <int> result;while(1){
int sum =getsum(n);if(sum ==1){returntrue;}if(result.find(sum)!= result.end()){returnfalse;}
result.insert(sum);
n = sum;}}};