# LeetCode Happy Number

123人阅读 评论(0)

Description:

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

Solution:

import java.util.*;

public class Solution {
public boolean isHappy(int n) {
HashSet<Integer> set = new HashSet<Integer>();

int temp = 0, ones;
while (true) {
temp = 0;
while (n > 0) {
ones = n % 10;
n /= 10;
temp += ones * ones;
}

n = temp;
if (n == 1)
return true;
if (set.contains(n))
break;
}

return false;
}
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：67822次
• 积分：3305
• 等级：
• 排名：第10629名
• 原创：288篇
• 转载：0篇
• 译文：0篇
• 评论：4条
文章分类
阅读排行
最新评论