leetcode 202: Happy Number

最新推荐文章于 2020-02-25 17:01:43 发布

原创最新推荐文章于 2020-02-25 17:01:43 发布 · 8.7k 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

216 篇文章

订阅专栏

本文介绍了一种算法，用于判断一个数是否为快乐数。快乐数定义为通过将数字转换为其各个位数的平方和，重复此过程直至得到1或陷入循环。通过实例演示了如何实现这一算法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Happy Number

Total Accepted: 3585 Total Submissions: 10859

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

[思路]

同计算循环小数一样, 如果出现循环, 则无需继续计算,直接返回false即可.

[code]

public class Solution {
    public boolean isHappy(int n) {
        if(n<=0) return false;
        long ln = n;
        Set<Long> set = new HashSet<Long>();
        
        while(ln<=Integer.MAX_VALUE) {
            if(set.contains(ln) ) return false; else set.add(ln);
            ln = digitSquare(ln);
            if(ln == 1) return true;
        }
        return false;
    }
    
    private long digitSquare(long ln) {
        long sum = 0;
        while(ln!=0) {
            sum += Math.pow(ln%10, 2);
            ln /= 10;
        }
        return sum;
    }
}