leetcode 202. Happy Number
Write an algorithm to determine if a number is “happy”.
A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers.
Example: 19 is a happy number
12 + 92 = 82
82 + 22 = 68
62 + 82 = 100
12 + 02 + 02 = 1
code
using namespace std;
class Solution {
public:
bool isHappy(int n) {
set<int> numSet;
set<int>::iterator iter;
int sum = 0;
int singleNum = 0;
if (n == 1)
{
return true;
}
while ((iter = numSet.find(n)) == numSet.end()) {
/* first handle */
numSet.insert(n);
while (n >= 10) {
singleNum = n % 10;
n = n / 10;
sum = sum + singleNum * singleNum;
}
sum = sum + n*n;
if (sum != 1) {
//loop start
n = sum;
}
else {
return true;
}
sum = 0;
}
return false;
}
};