Remove Linked List Elements

iteye_6755

于 2015-10-26 15:54:52 发布

阅读量76

点赞数

分类专栏： leetcode

leetcode 专栏收录该内容

193 篇文章

订阅专栏

本文介绍了一种算法，用于确定一个数字是否为“幸福数”。幸福数定义为通过替换数字的各位数平方和并重复该过程，最终结果为1的数字。通过使用HashSet避免无限循环，实现判断过程。

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

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) {
        HashSet<Integer> hashSet = new HashSet<>();
        while (n != 1) {
        	if (!hashSet.add(n)) {
        		return false;
        	}
        	char[] charArray = String.valueOf(n).toCharArray();
        	int sum = 0;
        	for (char c : charArray) {
        		sum += Math.pow(Integer.valueOf(c + ""), 2);
			}
        	n = sum;
        }
        return true;
    }
}