202. Happy Number 快乐数

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:
     Input: 19
     Output: true
     Explanation:
     12 + 92 = 82
     82 + 22 = 68
     62 + 82 = 100
     12 + 02 + 02 = 1
     编写一个算法来判断一个数是不是“快乐数”。
     一个“快乐数”定义为：对于一个正整数，每一次将该数替换为它每个位置上的数字的平方和，然后重复这个过程直到这个数变为 1，也可能是无限循环但始终变不到 1。如果可以变为 1，那么这个数就是快乐数。
     示例:
     输入: 19
     输出: true
     解释:
     12 + 92 = 82
     82 + 22 = 68
     62 + 82 = 100
     12 + 02 + 02 = 1

解题思路：这道题的关键在于怎么判断不是happy数，不是happy数算下来会一直循环，所以只要判断每个位置上的数的平方和已经出现过，就可以。
代码C++：
class Solution {
public:
bool isHappy(int n) {
unordered_map < int , int > ha;
int t =0;
while( t != 1)
{
if(ha.count(n))
return false;
ha[n] = 1;
t =0;
while(n)
{
t +=pow(n%10, 2);
n/=10;
}
n = t;
}
return true;
}
};