leetcode 202:Happy number

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


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
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);
}
}

leetcode 202: Happy Number

2015-04-25 07:17:51

【LeetCode-面试算法经典-Java实现】【202-Happy Number（开心数字）】

2015-08-26 07:20:12

【Leetcode】202-Happy Number【Java实现】【Easy】

2015-11-13 16:05:06

202. Happy Number [easy] (Python)

2016-05-04 15:43:14

leetcode_c++：哈希： Happy Number(202)

2016-07-09 15:02:39

[LeetCode]202. Happy Number(判断正整数是不是Happy Number)

2017-06-03 01:28:38

LeetCode 202:Happy Number

2015-05-08 22:12:21

LeetCode 202. Happy Number（快乐数字）

2016-05-04 05:56:13

LeetCode202——Happy Number快乐数

2015-08-03 10:33:19

leetcode-happy number implemented in python

2015-08-22 12:52:36