Problem:
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.
Analysis:
这个题可以完全按照题意进行,但是需要对题意进行准确理解,题意的意思:
*
写一个算法来确定一个数字是“快乐”。
快乐的编号是通过以下方法确定:用任意的正整数开始,由它的位数的平方和替换这个数,并重复该过程,直到数目等于1(其中,它将停留),或它循环无休止地在一个周期内不包括1.此过程结束前包括1就是快乐数字。
注意:是一个周期循环中不出现1,所以考虑到用set或者map。
- 由于set和map中元素是对象,所以将int类型进行了long类型的转换。
- 为了确定整数的位数需要用while循环整除的方法。
*
Anwser:
public class Solution {
public static boolean isHappy(int n) {
Set<Long> set = new HashSet<Long>();
long ln =n;
while(ln!=0){
if (set.contains(ln)) return false;
else set.add(ln);
ln=sqSum(ln);
if (ln==1) return true;
}
return false;
}
public static long sqSum(long m){
long result=0,number=0;
while(m!=0){
number = m % 10;
result += number * number;
m = m /10;
}
return result;
}
}