modify code

3 years ago · ff657c3269
parent 0de73b794e
commit ff657c3269
1 changed files with 0 additions and 3 deletions
--- a/体系学习班/class38/Code04_MoneyProblem.java
+++ b/体系学习班/class38/Code04_MoneyProblem.java
@ -71,9 +71,6 @@ public class Code04_MoneyProblem {
 			sum += num;
 		}
 		long[][] dp = new long[d.length + 1][sum + 1];
-		for (int i = 0; i <= sum; i++) {
-			dp[0][i] = 0;
-		}
 		for (int cur = d.length - 1; cur >= 0; cur--) {
 			for (int hp = 0; hp <= sum; hp++) {
 				// 如果这种情况发生，那么这个hp必然是递归过程中不会出现的状态