题目:
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
计算n的数字和,若为1,则是happy number,否则,判断是否在hashtable中,若在,则不是,不再则存入,循环进行;
代码:
import java.util.Hashtable;
public class Solution {
public boolean isHappy(int n) {
Hashtable<Integer,Integer> ht = new Hashtable<Integer,Integer>();
while(true){
char[] digits = new Integer(n).toString().toCharArray();
int squareSum = 0;
for(char c:digits){
squareSum += Math.pow(c-'0', 2);
}
if(squareSum == 1)
return true;
if(ht.containsKey(squareSum))
return false;
else
ht.put(squareSum, 1);
n = squareSum;
}
}
}