Package g0201_0300.s0202_happy_number
Class Solution
java.lang.Object
g0201_0300.s0202_happy_number.Solution
202 - Happy Number.<p>Easy</p>
<p>Write an algorithm to determine if a number <code>n</code> is happy.</p>
<p>A <strong>happy number</strong> is a number defined by the following process:</p>
<ul>
<li>Starting with any positive integer, replace the number by the sum of the squares of its digits.</li>
<li>Repeat the process until the number equals 1 (where it will stay), or it <strong>loops endlessly in a cycle</strong> which does not include 1.</li>
<li>Those numbers for which this process <strong>ends in 1</strong> are happy.</li>
</ul>
<p>Return <code>true</code> <em>if</em> <code>n</code> <em>is a happy number, and</em> <code>false</code> <em>if not</em>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> n = 19</p>
<p><strong>Output:</strong> true</p>
<p><strong>Explanation:</strong></p>
<p>1<sup>2</sup> + 9<sup>2</sup> = 82</p>
<p>8<sup>2</sup> + 2<sup>2</sup> = 68</p>
<p>6<sup>2</sup> + 8<sup>2</sup> = 100</p>
<p>1<sup>2</sup> + 0<sup>2</sup> + 0<sup>2</sup> = 1</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> n = 2</p>
<p><strong>Output:</strong> false</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= n <= 2<sup>31</sup> - 1</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
isHappy
public boolean isHappy(int n)
-