Package g2501_2600.s2520_count_the_digits_that_divide_a_number

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2520 - Count the Digits That Divide a Number.

    Easy

    Given an integer num, return the number of digits in num that divide num.

    An integer val divides nums if nums % val == 0.

    Example 1:

    Input: num = 7

    Output: 1

    Explanation: 7 divides itself, hence the answer is 1.

    Example 2:

    Input: num = 121

    Output: 2

    Explanation: 121 is divisible by 1, but not 2. Since 1 occurs twice as a digit, we return 2.

    Example 3:

    Input: num = 1248

    Output: 4

    Explanation: 1248 is divisible by all of its digits, hence the answer is 4.

    Constraints:

    • <code>1 <= num <= 10<sup>9</sup></code>

    • num does not contain 0 as one of its digits.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer countDigits(Integer num)

      • Methods inherited from class java.lang.Object

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