Problem Brief

Happy Number

INTERNOA

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 1 if n is a happy number, and 0 if not.

1Example 1

Input

n = 19

Output

Explanation

1^2 + 9^2 = 82

8^2 + 2^2 = 68

6^2 + 8^2 = 100

1^2 + 0^2 + 0^2 = 1

Input

n = 2

Output

Explanation

The number 2 is not a happy number as it does not end in 1 after following the process.

Limits and guarantees your solution can rely on.

Draft autosaves locally

public int isHappy(int n) {
  // write your code here (Feel free to refer to LC 202 :)
}

Input

Output