Smallest Divisible Digit Product I

You are given two integers n and t. Return the smallest number greater than or equal to n such that the product of its digits is divisible by t.

LeetCode Problem - 3345

class Solution {
    public int smallestNumber(int n, int t) {

        // Early exit for the case when t = 1
        if (t == 1) return n;

        while (true) {
            int prodOfN = findProdOfDigit(n);
            if (prodOfN % t == 0) {
                break;
            }
            n++;
        }
        return n;
    }

    public int findProdOfDigit(int num) {
        int result = 1;

        // If the number contains a zero, the product will be zero
        while (num != 0) {
            int digit = num % 10;
            if (digit == 0) return 0; // early exit if any digit is zero
            result *= digit;
            num /= 10;
        }
        return result;
    }
}