202. Happy Number

Easy

8.8K

1.1K

Write an algorithm to determine if a number `n`

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.
- 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.

Return `true`

*if* `n`

*is a happy number, and* `false`

*if not*.

**Example 1:**

Input:n = 19Output:trueExplanation:1^{2}+ 9^{2}= 82 8^{2}+ 2^{2}= 68 6^{2}+ 8^{2}= 100 1^{2}+ 0^{2}+ 0^{2}= 1

**Example 2:**

Input:n = 2Output:false

**Constraints:**

`1 <= n <= 2`

^{31}- 1

Accepted

1.2M

Submissions

2.1M

Acceptance Rate

54.9%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved