easy recursion math

263. Ugly Number
Solved
Easy
Topics
Companies
An ugly number is a positive integer whose prime factors are limited to 2, 3, and 5.

Given an integer n, return true if n is an ugly number.

 

Example 1:

Input: n = 6
Output: true
Explanation: 6 = 2 × 3
Example 2:

Input: n = 1
Output: true
Explanation: 1 has no prime factors, therefore all of its prime factors are limited to 2, 3, and 5.
Example 3:

Input: n = 14
Output: false
Explanation: 14 is not ugly since it includes the prime factor 7.
 

Constraints:

-231 <= n <= 231 - 1

Seen this question in a real interview before?
1/5
Yes
No
Accepted
573.1K
Submissions
1.4M
Acceptance Rate
42.2%
Topics
Math
Companies

Author: Gauranshgoel123

ugly-number.java

@@ -0,0 +1,10 @@
+class Solution {
+    public boolean isUgly(int n) {
+        if(n==0) return false;
+        if(n>0 && n<=3) return true;
+        if(n%2==0) return isUgly(n/2);
+        if(n%3==0) return isUgly(n/3);
+        if(n%5==0) return isUgly(n/5);
+        return false;
+    }
+}