算法设计与应用基础-第四周

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

• 1² + 9² = 82
• 8² + 2² = 68
• 6² + 8² = 100
• 1² + 0² + 0² = 1

根据题意，我们可以知道一个“Happy number”它需要在最后分解后平方总和为1，否则如果不为1，就用一个集合把他们存起来，如果集合中出现过这个数，就说明这个数会进入一个没有1的循环里面。

#include <cmath>
#include <vector>
class Solution {
public:
    bool isHappy(int n) {
        vector<int> res;
        if(n==1) return true;
        else
        {
            while(n!=1)
            {
                int sum=0;
                while(n!=0)//分解
                {
                    sum += pow(n%10,2);
                    n=n/10;
                }
                if(find(res.begin(),res.end(),sum)!=res.end()) //检查是否已存在，即检查是否循环
                    return false;
                else
                {
                    res.push_back(sum);
                }
                n=sum;
            }
            return true;
        }
    }
};