blob: e946b9669c70b2dd6f34e4977a13c457d521aa90 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
|
#include "leetcode.h"
class Solution {
public:
bool isHappy(int n) {
int slow, fast;
slow = fast = n;
do {
slow = square(slow);
for (int i = 0; i < 2; i++)
fast = square(fast);
} while (slow != fast);
if (slow == 1)
return 1;
else
return 0;
}
private:
int square(int n) {
int num = 0, tmp;
while (n) {
tmp = n % 10;
num += tmp * tmp;
n /= 10;
}
return num;
}
};
int main() {
Solution obj;
if (obj.isHappy(19))
cout << "true";
else
cout << "false";
}
|