leetcode 202:Happy number

最新推荐文章于 2021-09-12 12:51:45 发布

tuobadon

最新推荐文章于 2021-09-12 12:51:45 发布

阅读量392

点赞数

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

本文链接：https://blog.csdn.net/tuobadon/article/details/46802173

版权

leetcode 专栏收录该内容

25 篇文章 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*1 + 9*9 = 82
8*8 + 2*2 = 68
6*6 + 8*8 = 100
1*1 + 0*0 + 0*0 = 1

分析：
本地考察一个数是否为happy number，根据happy number的规定来进行解题，将给定的数按位存入数组，对数组每一项求平方再求和，最终结果若为1则返回true;在这一过程中，利用hashset判定某个数是否已经出现过，若已经出现过，则返回false.
代码：

import java.util.HashSet;
import java.util.Set;

public class happyNumber {
    public static boolean isHappy(int n){
        if(n<=0) return false;
        long ln=n;
        Set<Long> set=new HashSet<Long>();
        while(ln<=Integer.MAX_VALUE){
            if(set.contains(ln))
                return false;
            else
                set.add(ln);
            ln=digitSquare(ln);
            if(ln==1) return true;
        }
        return false;
    }
    private static long digitSquare(long ln){
        long sum=0;
        while(ln!=0){
            sum +=Math.pow(ln%10, 2);
            ln /=10;
        }
        return sum;
    }
    public static void main(String[] args){
        int n=19;
        boolean result=isHappy(n);
        System.out.println("isHappy:"+result);
    }
}