202. Happy Number(easy)

Easy

952248FavoriteShare

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:

12 + 92 = 82

82 + 22 = 68

62 + 82 = 100

12 + 02 + 02 = 1

 

C++：

/*
 * @Author: SourDumplings
 * @Date: 2019-08-09 11:24:05
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/happy-number/
 */

class Solution
{
public:
    bool isHappy(int n)
    {
        int checkNum = 100;
        while (checkNum--)
        {
            if (check(n))
            {
                return true;
            }
        }
        return false;
    }

    bool check(int &n)
    {
        string s = to_string(n);
        int sum = 0;
        for (char d : s)
        {
            int dd = d - '0';
            sum += dd * dd;
        }
        if ((n = sum) == 1)
        {
            return true;
        }
        return false;
    }
};

Java：

/*
 * @Author: SourDumplings
 * @Date: 2019-08-09 11:32:24
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/happy-number/
 */

class Solution
{
    public boolean isHappy(int n)
    {
        int repeatNum = 100;
        while (repeatNum-- != 0)
        {
            if ((n = doCheck(n)) == 1)
                return true;

        }
        return false;
    }

    private int doCheck(int n)
    {
        String num = new Integer(n).toString();
        int l = num.length();
        int res = 0;
        for (int i = 0; i < l; i++)
        {
            Character d = num.charAt(i);
            int digit = Integer.parseInt(d.toString());
            res += digit * digit;
        }
        return res;
    }
}