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。
思路:记录每次各位相加结果,如果出现1返回true,出现和之前重复的数,则代表有循环存在,返回false
代码
package HashTable; import java.util.HashSet; import java.util.Set; /** * @author OovEver * 2018/1/9 10:34 */ public class LeetCode202 { public static boolean isHappy(int n) { Set<Integer> inLoop = new HashSet<>(); int squareSum=0, remain=0; 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; } }