We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 7f53ed5 commit e5e509dCopy full SHA for e5e509d
src/main/java/g3301_3400/s3348_smallest_divisible_digit_product_ii/Solution.java
@@ -25,14 +25,14 @@ public String smallestNumber(String num, long t) {
25
i0 = i;
26
break;
27
}
28
- leftT[i + 1] = leftT[i] / gcd(leftT[i], s[i] - '0');
+ leftT[i + 1] = leftT[i] / gcd(leftT[i], (long) s[i] - '0');
29
30
if (leftT[n] == 1) {
31
return num;
32
33
for (int i = i0; i >= 0; i--) {
34
while (++s[i] <= '9') {
35
- long tt = leftT[i] / gcd(leftT[i], s[i] - '0');
+ long tt = leftT[i] / gcd(leftT[i], (long) s[i] - '0');
36
for (int j = n - 1; j > i; j--) {
37
if (tt == 1) {
38
s[j] = '1';
0 commit comments