# 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】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
• 2015年01月13日 15:04
• 10973

## 【LeetCode】Ugly Number II 解题报告

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

## 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
• 2017年03月11日 10:58
• 263

举报原因： 您举报文章：LeetCode-Happy Number-解题报告 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)