Package g3401_3500.s3490_count_beautiful_numbers

Class Solution

java.lang.Object

g3401_3500.s3490_count_beautiful_numbers.Solution

public class Solution
extends Object

3490 - Count Beautiful Numbers.

Hard

You are given two positive integers, l and r. A positive integer is called beautiful if the product of its digits is divisible by the sum of its digits.

Return the count of beautiful numbers between l and r, inclusive.

Example 1:

Input: l = 10, r = 20

Output: 2

Explanation:

The beautiful numbers in the range are 10 and 20.

Example 2:

Input: l = 1, r = 15

Output: 10

Explanation:

The beautiful numbers in the range are 1, 2, 3, 4, 5, 6, 7, 8, 9, and 10.

Constraints:

• 1 <= l <= r < 109

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	beautifulNumbers(int l, int r)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

beautifulNumbers

public int beautifulNumbers(int l,
 int r)