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
Credits:
Special thanks to @mithmatt and @ts for adding this problem and creating all test cases.
程序思路:
1、创建一个val和一个string来取各位,hashset来存储各个数
2、如果val等于1或者hashset已经包含当前数,跳出循环
3、判断是因为等于1跳出的,还是形成loop退出的,返回相应的true或者false
代码如下:
public class Solution {
public boolean isHappy(int n) {
HashSet<Integer> hs = new HashSet<Integer>();
int val = n;
String strval = Integer.toString(val);;
while (val != 1) {
strval = Integer.toString(val);
val = 0;
for (int i = 0; i < strval.length(); i++) {
val += (strval.charAt(i) - '0') * (strval.charAt(i) - '0');
}
if (hs.contains(val)) {
break;
} else {
hs.add(val);
}
}
if (val == 1) {
return true;
} else {
return false;
}
}
}
比较简洁的代码如下:
public boolean isHappy(int n) {
Set<Integer> inLoop = new HashSet<Integer>();
int squareSum,remain;
while (inLoop.add(n)) {
squareSum = 0;
while (n > 0) {
remain = n%10;
squareSum += remain*remain;
n /= 10;
}
if (squareSum == 1)
return true;
else
n = squareSum;
}
return false;
}
这里获取各位的数,比较巧妙:
while (n > 0) { remain = n%10; squareSum += remain*remain; n /= 10; }