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:

$$1^2 + 9^2 = 82$$
$$8^2 + 2^2 = 68$$
$$6^2 + 8^2 = 100$$
$$1^2 + 0^2 + 0^2 = 1$$

思考

根据例子中的过程实现。
为了避免死循环，设定最多循环次数turns。

答案

c++

class Solution {
public:
    bool isHappy(int n) {
        int turns = 100;
        int temp = n;
        int result = n;
        while (turns) {
            temp = result;
            result = 0;
            for (; temp != 0; temp = temp / 10) {
                result += (temp % 10) * (temp % 10);
            }
            if (result == 1) break;
            turns--;  
        }
        if (result != 1) return false;
        return true;
    }
};