202. Happy Number

Easy

10 Points

Hash Table

Math

Two Pointers

Write an algorithm to determine if a number n is happy. A happy number is a number defined by the following process: Return true if n is a happy number, and false if not.

Examples

Example 1

Input: n = 19 Output: true Explanation: 12 + 92 = 82 82 + 22 = 68 62 + 82 = 100 12 + 02 + 02 = 1

Example 2

Input: n = 2 Output: false

Constraints

1 <= n <= 231 - 1