题目:
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,返回true,否则先判断该数是否HashMap中已有,有的话就进入了循环,返回false,否者将该数放入HashMap,代码如下:
public class Solution {
public boolean isHappy(int n) {
HashMap<Integer,Integer> hashMap = new HashMap<>();
int temp = n,sum = 0;
int key = 0;
while (true) {
while (temp != 0) {
sum += (temp % 10) * (temp % 10);
temp /= 10;
}
if (sum == 1) {
return true;
} else {
if (hashMap.containsValue(sum)) {
return false;
}
}
hashMap.put(key++,sum);
temp = sum;
sum = 0;
}
}
}