202. Happy Number
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
题目:
快乐数定义为:
1. 算出这个数的数字的平方和;
2. 用这个平方和代替这个数字,重复过程1;
3. 如果这个平方和最后等于1 ,那么这是一个快乐数,返回true;
4. 如果在循环的过程中,出现环,即这个数的数字平方和已经出现过了,则返回false;
5. 利用set来存储每次数字的平方和,set的add函数,当出现重复的时候,会返回false;
6. 注意算平方和的时候使用remin*remin,我使用remin^2出现了错误,不知道为什么;
public class Solution {
public boolean isHappy(int n) {
int sum;
int num=n;
int remin;
HashSet hashSet=new HashSet<>();
while(hashSet.add(num)){
sum=0;
while(num>0){
remin=num%10;
sum+=remin*remin;
num/=10;
}
if(sum==1)
return true;
num=sum;
}
return false;
}
}