202. Happy Number（python+cpp）

题目：

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: 1² + 9²= 82 8² + 2² = 68 6² + 8² = 100 1² + 0² + 0² = 1

解释：
要用一个set()记录当前的值是否出现过，作为while语句的判断条件，如果出现过则进入无限循环了，最后跳出循环的时候判断最终的值是否是1。
python代码：

class Solution:
    def isHappy(self, n):
        """
        :type n: int
        :rtype: bool
        """
        n_set=set()
        while n not in n_set:
            n_set.add(n)
            total=0
            while n:
                total+=(n%10)**2
                n//=10
            n=total
        return n==1

c++代码：

#include<set>
#include<cmath>
using namespace std;
class Solution {
public:
    bool isHappy(int n) {
        set<int>set_n;
        while(set_n.count(n)==0)
        {
            set_n.insert(n);
            int total=0;
            while (n)
            {
                total+=pow((n%10),2);
                n/=10;
            }
            n=total;
        }
        return n==1;
    }
};

总结：
还是要学会用取余数和除法的方式求得每一位的数字，不要用str()，因为这不是一般的方法往往换个语言就不能用了。