-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathSumOfNumbersWithUnitsDigitK.java
60 lines (53 loc) · 1.52 KB
/
SumOfNumbersWithUnitsDigitK.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
/*https://leetcode.com/problems/sum-of-numbers-with-units-digit-k/*/
class Solution {
Integer[] dp;
int minSize;
public int minimumNumbers(int num, int k) {
if (num == 0) return 0;
minSize = Integer.MAX_VALUE;
int count = 0, i;
dp = new Integer[3001];
int curr = k == 0 ? 10 : k, res;
while (curr <= num)
{
res = recur(num,curr,curr,1,k);
if (res != -1) ++count;
curr += 10;
}
return minSize == Integer.MAX_VALUE ? -1 : minSize;
}
public int recur(int num, int curr, int currStart, int currCount, int k)
{
if (curr == num)
{
dp[num] = currCount;
minSize = Math.min(minSize,currCount);
return currCount;
}
if (curr > num) return -1;
if (dp[curr] != null) return dp[curr];
int next = currStart;
int count = 0;
while (next <= num)
{
int res = recur(num,curr+next,currStart,currCount+1,k);
if (res != -1) ++count;
next += 10;
}
dp[curr] = currCount+1;
return dp[curr];
}
}
class Solution {
public int minimumNumbers(int num, int k) {
if (num == 0) return 0;
else if (num == k) return 1;
int val;
for (int i = 1; i <= 10; ++i){
val = i * k;
if (val % 10 == num % 10 && val <= num)
return i;
}
return -1;
}
}