Happy Number

Easy

A number is happy if repeatedly replacing it by the sum of the squares of its digits eventually reaches 1. Numbers that never reach 1 loop forever. Return true if n is happy.

Example 1

Input:  n = 19
Output: true
Explanation: 1+81=82, 64+4=68, 36+64=100, 1 -> happy.

Example 2

Input:  n = 2
Output: false

Constraints

• 1 <= n <= 2^31 - 1