Happy Numbe

最新推荐文章于 2016-06-21 22:33:34 发布

漁陽

最新推荐文章于 2016-06-21 22:33:34 发布

阅读量367

点赞数

分类专栏： Leetcode 文章标签： happy number

本文链接：https://blog.csdn.net/I_peter/article/details/51212279

版权

Leetcode 专栏收录该内容

48 篇文章 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

1^2 （代表1的平方）+ 9^2 = 82
8^2 + 2^2 = 68
6^2 + 8^2 = 100

1^2 + 0^2 + 0^2 = 1
==========================**********=========================

public class Solution {
    public boolean isHappy(int n) {
         if (n <= 0) return false;


    int magic = 4;
    while (true) {
        if (n == 1) return true;
        if (n == magic) return false;
        int t = 0;
        while (n!=0) {
            t += (n % 10) * (n % 10);
            n /= 10;
        }
        n = t;
    }
 
    }
}
=======================常规做法==========================================
public class Solution {
    public boolean isHappy(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 ;
    }
}