[leetcode] 202. Happy Number 解题报告

题目链接: https://leetcode.com/problems/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

思路: 用一个hash表保存运算过的数, 如果没有出现过就继续运算, 否则就跳出, 最后看是否最后的运算的数是否是1即可

代码如下:

class Solution {
public:
    bool isHappy(int n) {
        string str = to_string(n);
        unordered_map<string, bool> hash;
        while(hash.count(str)==0)
        {
            hash[str] = true;
            int cnt = 0;
            for(int i = 0; i< str.size(); i++)
                cnt += (str[i]-'0')*(str[i]-'0');
            str = to_string(cnt);
        }
        return str == "1";
    }
};