关闭

leetcode 202:Happy number

标签: leetcode
113人阅读 评论(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);
    }
}
0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:7479次
    • 积分:388
    • 等级:
    • 排名:千里之外
    • 原创:33篇
    • 转载:2篇
    • 译文:0篇
    • 评论:0条