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 and replace the number by the Sum of the squares of its digits, and repeat the process until the number equals 1 (where it would stay), or it loops Endl essly in a cycle which does not include 1. Those numbers for which this process ends in 1 is happy numbers.
EXAMPLE:  is a happy number
- 12 + 92 = 82
- 82 + 22 = 68
- 62 + 82 = 100
Class Solution {public: bool Ishappy (int n) { int count = 0; int sum = n; while (sum! = 1) { n = sum; sum = 0; while (n) { sum + = (n%10) * (N%10); n/=10; } count++; if (count = =) return false; } return true; }};
Since not the number of happy numbers will be infinite loop, here I set a counter, more than 100 times is not considered. But it also misses some of the things that are not well thought out.
Leetcode15:happy number