leetcode题解-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
1^2 + 9^2 = 82
8^2 + 2^2 = 68
6^2 + 8^2 = 100
1^2 + 0^2 + 0^2 = 1
思路一：按照HappyNumber的定义进行思考，将各位数字进行求和，最后若等于1则返回真，若出现循环则为假。这里使用hashset来存储一个数字是否出现过。这种算法效果还可以，击败了68%的用户

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

思路二，对其稍加改进，这里注意y=cal(cal(y))，的作用是连续计算两次。这样可以加速进程，当x==y的时候，就表明出现了循环。而不需要使用hashset来存储曾经出现过的值。这种方法击败了85%的用户。

public boolean isHappy1(int n) {
        int x = n;
        int y = n;
        while(x>1){
            x = cal(x) ;
            if(x==1) return true ;
            y = cal(cal(y));
            if(y==1) return true ;

            if(x==y) return false;
        }
        return true ;
    }
    public int cal(int n){
        int x = n;
        int s = 0;
        while(x>0){
            s = s+(x%10)*(x%10);
            x = x/10;
        }
        return s ;
    }