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

public class Solution {
    public boolean isHappy(int n) {
        if(n <= 0){
            return false;
        }
        long m = n;
        Set<Long> set = new HashSet<Long>();
        while(m <= Integer.MAX_VALUE){
            if(set.contains(m)){
                return false;
            }else{
                set.add(m);
            }
            m = sumResult(m);
            if(m == 1){
                return true;
            }
        }
        return false;
    }
    public int powResult(int n){
        String str = String.valueOf(n);
        int count = 0;
        for(int i=0;i<str.length();i++){
            count += Integer.parseInt(str.substring(i,i+1)) * Integer.parseInt(str.substring(i,i+1));
        }
        return count;
    }
    private long sumResult(long num){
        long sum = 0;
        while(num != 0){
            sum += Math.pow(num%10,2);
            num /= 10;
        }
        return sum;
    }
}