202. Happy Number

最新推荐文章于 2020-04-30 11:11:07 发布

myfwjy

最新推荐文章于 2020-04-30 11:11:07 发布

阅读量161

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/myfwjy/article/details/53172580

版权

LeetCode 专栏收录该内容

91 篇文章 0 订阅

订阅专栏

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) {
        int num = n;
        if(num == 1)
        	return true;
        List<Integer> cache = new ArrayList<Integer>();
        while(num != 1 && !cache.contains(num)){
        	cache.add(num);
        	num = calculate(num);        	
        }
        if(num == 1)
        	return true;
        if(cache.contains(num))
        	return false;
        return false;
    }
    
    public  int calculate(int num) {
	int sum = 0;
    	while(num != 0){
		int x = num % 10;
		sum += Math.pow(x, 2);
		num /= 10;
	}
    	return sum;
    }
}