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

Difficulty: Medium

两个语言的思路是一样的，Python用了set()，C++用了map来查找重复

</pre><pre name="code" class="cpp">class Solution {
public:
    bool isHappy(int n) {
        map<int,int> m;
        //map<int,int >::iterator l_it;;
        while(n!=1)
        {
            if(m.find(n)!=m.end())
                break;
            m.insert(pair<int,int>(n,1));
            int ans = 0;
            while(n!=0)
            {
                ans+= (n%10)*(n%10);
                n = n/10;
            }
            n = ans;
        }
        if(n==1)
            return true;
        else
            return false;
    }
};

class Solution(object):
    def isHappy(self, n):
        """
        :type n: int
        :rtype: bool
        """
        numSet = set()
        while n not in numSet and n!=1:
            numSet.add(n)
            ans=0
            while n!=0:
                ans+=(n%10)*(n%10)
                n = n/10
            n = ans
        return n==1