LeetCode-Happy Number-解题报告

原创 2015年07月08日 19:01:10

原题链接 https://leetcode.com/problems/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

  • 12 + 92 = 82
  • 82 + 22 = 68
  • 62 + 82 = 100
  • 12 + 02 + 02 = 1
模拟法,模拟题中描述的方法即可。使用hash记录那个数字访问过没有就行了。


class Solution {
public:
    bool isHappy(int n) {
		unordered_map<int, bool>vis;
		while (n != 1)
		{
			vis[n] = true;
			n = getSs(n);
			if (vis[n])return false;
		}
		return true;
	}
	int getSs(int x)
	{
		int sum = 0;
		while (x)
		{
			int t = x % 10;
			sum += t*t;
			x /= 10;
		}
		return sum;
	}
};


相关文章推荐

【LeetCode】Number of 1 Bits 解题报告

Number of 1 Bits[LeetCode]https://leetcode.com/problems/number-of-1-bits/Total Accepted: 88721 Total...

【LeetCode】Largest Number 解题报告

【题目】 Given a list of non negative integers, arrange them such that they form the largest number...
  • ljiabin
  • ljiabin
  • 2015年01月13日 15:04
  • 10973

[leetcode] 305. Number of Islands II 解题报告

题目链接: https://leetcode.com/problems/number-of-islands-ii/ A 2d grid map of m rows and n columns i...

【LeetCode】Ugly Number II 解题报告

Ugly Number II[LeetCode] Write a program to find the n-th ugly number.

LeetCode解题报告--Letter Combinations of a Phone Number

题目:字母组合的电话号码 Given a digit string, return all possible letter combinations that the number could re...

LeetCode — Single Number II 解题报告

题目如下: 题目解析:     题目的意思:给定含n个整数的数组,其中除了1个数之外,其余的数出现3次。求这个出现1次的数字是什么?     在Single Number这道题目的时候,...

[Leetcode] 321. Create Maximum Number 解题报告

题目: Given two arrays of length m and n with digits 0-9 representing two numbers. Create the m...

LeetCode解题报告 452. Minimum Number of Arrows to Burst Balloons [medium]

题目描述 There are a number of spherical balloons spread in two-dimensional space. For each balloon, ...

LeetCode 137. Single Number II 解题报告

LeetCode 137. Single Number II 解题报告

[LeetCode] 452. Minimum Number of Arrows to Burst Balloons 解题报告

There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided...
  • a921122
  • a921122
  • 2017年03月11日 10:58
  • 263
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:LeetCode-Happy Number-解题报告
举报原因:
原因补充:

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