# LeetCode-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

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-Missing Number-解题报告

2015-08-27 16:16:05

#### LeetCode-Largest Number-解题报告

2015-07-02 19:35:42

#### LeetCode-Single Number-解题报告

2015-08-28 18:55:51

#### LeetCode-Ugly Number-解题报告

2015-08-28 16:41:49

#### 【POJ 2104】(K-th Number-区间第k大-主席树)

2015-12-15 20:55:20

#### LeetCode-Excel Sheet Column Number-解题报告

2015-07-03 18:31:29

#### poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告

2009年10月06日 9KB 下载

#### ＊LeetCode-Happy Number

2015-09-16 04:33:36

#### LeetCode 313. Super Ugly Number

2016-03-29 23:24:34

#### leetcode-Happy Number

2015-11-05 10:50:38