leetcode 202. Happy Number

最新推荐文章于 2025-06-14 19:45:10 发布

蓝羽飞鸟

最新推荐文章于 2025-06-14 19:45:10 发布

阅读量184

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/level_code/article/details/90813247

版权

leetcode 专栏收录该内容

490 篇文章

订阅专栏

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，就返回true

思路：
如果不是happy number，求和的过程中会出现循环，所以只要出现循环就返回false，出现1时返回true

    public boolean isHappy(int n) {
        HashSet<Integer> list = new HashSet<>();
        
        int cal = 0;
        
        while (true) {
            cal = cal(n);
            
            if (cal == 1) {
                return true;
            }
            if (list.contains(cal)) {
                return false;
            } else {
                list.add(cal);
            }
            n = cal;
        }
    }
    
    public int cal(int num) {
        int result = 0;
        while (num != 0) {
            result += (num % 10) * (num % 10);
            num /= 10;
        }
        
        return result;
    }