LeetCode-Happy Number

最新推荐文章于 2020-05-07 11:25:40 发布

weixin_33935777

最新推荐文章于 2020-05-07 11:25:40 发布

阅读量47

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/incrediblechangshuo/p/5503859.html

本文介绍了一种算法，用于确定一个数字是否为快乐数。快乐数定义为通过将数字的每一位平方并求和，最终结果等于1的数字。文章详细解释了算法实现，并通过示例演示了快乐数的判断过程。

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

public class Solution {
    public boolean isHappy(int n) {
        Set<Integer> numberSet = new HashSet<Integer>();
        while(n!=1){
            if(!numberSet.add(n)){
                return false;
            }
            char[] chars = String.valueOf(n).toCharArray();
            int total = 0;
            for(Character ch: chars){
                total += Math.pow(Integer.parseInt(ch+""),2);
            }
            n = total;
        }
        return true;
    }
}

转载于:https://www.cnblogs.com/incrediblechangshuo/p/5503859.html