263. Ugly Number

Problem Statement

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:

-2³¹ <= n <= 2³¹ - 1

Solution:

Rust

impl Solution {
    pub fn is_ugly(n: i32) -> bool {
        if n < 1 {
            return false;
        }

        let divisors = [2, 3, 5];
        let mut n = n;

        for divisor in divisors {
            // Divide n by divisor as many times as possible
            while n % divisor == 0 {
                n /= divisor;
            }
        }

        n == 1
    }
}

263. Ugly Number #

Problem Statement #

Solution: #

... #

263. Ugly Number

Problem Statement

Solution:

...