lc202-Happy Number

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
#include <iostream>
#include <vector>
using namespace std;
class Solution {
vector<int> myVec;
public:
bool isHappy(int n) {
if (std::find(myVec.begin(), myVec.end(), n) != myVec.end())
{
if(n!=1) return false;
}
myVec.push_back(n);
int sum=0,m;
m=n;
while(m){
sum+=(m%10)*(m%10);
m/=10;
}
if(sum==1) return true;
else return isHappy(sum);
}
};