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: 

Input: 19
Output: true
Explanation: 
1^2 + 9^2 = 82
8^2 + 2^2 = 68
6^2 + 8^2 = 100
1^2 + 0^2 + 0^2 = 1

由于按照快乐数的定义需要对结果不断迭代，最终结果是1的话说明是快乐数，但是由于可能会重复出现之前的结果，这样迭代会陷入死循环，所以需要用一个集合来存储中间结果，如果发现重复就跳出循环，最终结果不是1，说明这个数不是快乐数，否则就是快乐数。

class Solution {
public:
    bool isHappy(int n) {
        set<int> s;
        while(n>0)
        {
            int sum=getSum(n);
            if(s.count(sum)==0) 
            {
                s.insert(sum);
                n=sum;
            }
            else break;
        }
        
        set<int>::iterator it=s.begin();
        for(;it!=s.end();it++) if(*it==1) return true;
        return false;
    }
    
    int getSum(int n)
    {
        int sum=0;
        while(n>0)
        {
            sum+=(n%10)*(n%10);
            n/=10;
        }
        return sum;
    }
};