Happy Number

原创 2015年07月09日 09:29:31

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


202. Happy Number [easy] (Python)

题目链接https://leetcode.com/problems/happy-number/题目原文 Write an algorithm to determine if a number is...
  • coder_orz
  • coder_orz
  • 2016年05月04日 15:43
  • 2314

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

【202-Happy Number(开心数字)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】代码下载【https://github.com/Wang-Jun-Chao】原题  ...
  • DERRANTCM
  • DERRANTCM
  • 2015年08月26日 07:20
  • 5810

leetcode 202: Happy Number

Happy Number Total Accepted: 3585 Total Submissions: 10859 Write an algorithm to determi...
  • xudli
  • xudli
  • 2015年04月25日 07:17
  • 7736

leetcode-happy number implemented in python

class Solution(object): def isHappy(self, n): if n==1: return True e...
  • xunileida
  • xunileida
  • 2015年08月22日 12:52
  • 843

LeetCode 刷题: Happy Number 的判断

Write an algorithm to determine if a number is "happy". A happy number is a number defined by the f...
  • guilanl
  • guilanl
  • 2015年12月28日 15:38
  • 491

LeetCode题解:Happy Number

Write an algorithm to determine if a number is “happy”.A happy number is a number defined by the fol...
  • u012403246
  • u012403246
  • 2015年08月26日 20:17
  • 733

[leetcode]Happy Number C语言

【题目】 Write an algorithm to determine if a number is “happy”. A happy number is a number defined by...
  • noc_lemontree
  • noc_lemontree
  • 2015年08月29日 21:00
  • 1162

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

Write an algorithm to determine if a number is “happy”.A happy number is a number defined by the fol...
  • mijian1207mijian
  • mijian1207mijian
  • 2016年07月09日 15:02
  • 198

leetcode笔记:Happy Number

题目要求对任意一个正整数,不断各个数位上数字的平方和,若经过若干次运算后结果收敛到1,则该数字为Happy Number。...
  • liyuefeilong
  • liyuefeilong
  • 2015年11月05日 15:20
  • 1753

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

Your runtime beats 82.86% of java submissions. stem: Write an algorithm to determine if a number ...
  • ALiTuTu
  • ALiTuTu
  • 2015年11月13日 16:05
  • 1017
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Happy Number
举报原因:
原因补充:

(最多只允许输入30个字)