g0201_0300.s0202_happy_number.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0201_0300.s0202_happy_number;
// #Easy #Top_Interview_Questions #Hash_Table #Math #Two_Pointers #Algorithm_II_Day_21_Others
// #Programming_Skills_I_Day_4_Loop #Level_2_Day_1_Implementation/Simulation
// #2022_06_28_Time_1_ms_(98.59%)_Space_41_MB_(64.25%)
public class Solution {
public boolean isHappy(int n) {
boolean happy;
int a = n;
int rem;
int sum = 0;
if (a == 1 || a == 7) {
happy = true;
} else if (a > 1 && a < 10) {
happy = false;
} else {
while (a != 0) {
rem = a % 10;
sum = sum + (rem * rem);
a = a / 10;
}
if (sum != 1) {
happy = isHappy(sum);
} else {
happy = true;
}
}
return happy;
}
}