We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 15f8100 commit efa3855Copy full SHA for efa3855
LeetcodeProblems/Algorithms/Happy_Number.js
@@ -16,10 +16,10 @@ Example 1:
16
Input: n = 19
17
Output: true
18
Explanation:
19
-12 + 92 = 82
20
-82 + 22 = 68
21
-62 + 82 = 100
22
-12 + 02 + 02 = 1
+1^2 + 9^2 = 82
+8^2 + 2^2 = 68
+6^2 + 8^2 = 100
+1^2 + 0^2 + 0^2 = 1
23
24
Example 2:
25
Input: n = 2
@@ -46,4 +46,4 @@ function checkHappyNumber(n){
46
return checkHappyNumber(digit)
47
}
48
49
-module.exports.isHappy = isHappy;
+module.exports.isHappy = isHappy;
0 commit comments