g0201_0300.s0263_ugly_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-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g0201_0300.s0263_ugly_number;
// #Easy #Math
public class Solution {
public boolean isUgly(int n) {
if (n == 1) {
return true;
} else if (n <= 0) {
return false;
}
int[] factors = new int[] {2, 3, 5};
for (int factor : factors) {
while (n > 1 && n % factor == 0) {
n /= factor;
}
}
return n == 1;
}
}