leetcode Happy Number题解

最新推荐文章于 2020-02-16 22:57:17 发布

leo_weile

最新推荐文章于 2020-02-16 22:57:17 发布

阅读量139

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/leo_weile/article/details/87979782

版权

leetcode 专栏收录该内容

162 篇文章 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:

Input: 19
Output: true
Explanation: 
12 + 92 = 82
82 + 22 = 68
62 + 82 = 100
12 + 02 + 02 = 1

中文理解：给定一个数，判断该树是不是快乐数，快乐数满足的条件是若干轮后，该数的各个数位的平方和为1。

解题思路：快乐数具有这个特点：若干轮后该数的各个数位平方和为1，非快乐数的特点是中间会产生4这个数字，可以将这个作为返回false的条件。

代码（java）：

class Solution {
    public boolean isHappy(int n) {
        while(n>0){
            if (n == 1)
            return true;
            if (n < 1 || n == 4)
                return false;           
            int sum = 0;
            while (n != 0) {          
                sum += Math.pow((n % 10),2);
                n /= 10;  
            }
            n=sum;
        }
        return false;
    }
}