Update DynamicProgramming/MinimumSumPartition.java
Co-authored-by: Du Yuanchao <shellhub.me@gmail.com>
This commit is contained in:
parent
6fdd9c90da
commit
e8a4628c96
@ -27,7 +27,7 @@ public class MinimumSumPartition
|
|||||||
for (int i = 0; i <= n; i++) {
|
for (int i = 0; i <= n; i++) {
|
||||||
dp[i][0] = true;
|
dp[i][0] = true;
|
||||||
}
|
}
|
||||||
for(int j = 0; j < sum; j++){
|
for (int j = 0; j <= sum; j++) {
|
||||||
dp[0][j] = false;
|
dp[0][j] = false;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user