Leetcode-202. Happy Number

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN，mcf171专栏。

博客链接：mcf171的博客

——————————————————————————————

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

这个题目可以用一个set保存已经计算过的sum，如果在set中能找到重复的sum那么必然不是happy number。 Your runtime beats 63.20% of java submissions

public class Solution {
    public boolean isHappy(int n) {
        Set<Integer> visited = new HashSet<Integer>();
        boolean isHappy = true;
        while(n!=1){
            int sum = 0;
            while(n!=0){
                int number = n % 10;
                sum += number * number;
                n/=10;
            }
            if(visited.contains(sum)){isHappy = false;break;}
            else visited.add(sum);
            n = sum;
        }
        
        return isHappy;
    }
}