Happy Number

1 题目描述

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

• 12 + 92 = 82
• 82 + 22 = 68
• 62 + 82 = 100
• 12 + 02 + 02 = 1

题目出处： https://leetcode.com/problems/happy-number/

2 解题思路

题型属于hashtable与math。将已经判断过的数字加入到hashset中，然后再比较，直到出现循环或者陈宫位置。

3 源代码

package com.larry.easy;

import java.util.HashSet;

public class HappyNumber {
	public int toOne(int n){
		int sum = 0;
		while(n != 0){
			int quo = n/10;
			int mod = n%10;
			sum += Math.pow(mod, 2);
			n = quo;
		}
		return sum;
	}
	
	public boolean isHappy(int n) {
		HashSet<Integer> hs = new HashSet<Integer>();
		while(true){
			boolean retn = hs.contains(n);
			if(retn) return false;
			else{
				int res = toOne(n);
				if(res == 1) return true;
				else {
					hs.add(n);
					n = res;
				}
			}
		}
    }
	
	public static void main(String[] args) {
		/*int na = 1;*/
		int na = 19;
		int n = na;
		HappyNumber hn = new HappyNumber();
		System.out.println(hn.isHappy(n));
	}
}