Deepslient
diff --git a/‎.idea/workspace.xml
Lines changed: 18 additions & 53 deletions b/‎.idea/workspace.xml
Lines changed: 18 additions & 53 deletions
diff --git a/‎out/production/leetcode/leetcode/CapPartition.class
-32 Bytes b/‎out/production/leetcode/leetcode/CapPartition.class
-32 Bytes
diff --git a/‎out/production/leetcode/leetcode/ClimbingStairs.class
0 Bytes b/‎out/production/leetcode/leetcode/ClimbingStairs.class
0 Bytes
diff --git a/‎src/leetcode/CoinChange.java
Lines changed: 5 additions & 0 deletions b/‎src/leetcode/CoinChange.java
Lines changed: 5 additions & 0 deletions
@@ -30,17 +30,22 @@ private int CoinChange(int[] coins, int amount) {
 		for (int i = 1; i <= amount; i++) {
 			int res = Integer.MAX_VALUE;
 			for (int j = 0; j < coins.length; j++) {
+				// 如果该值大于i，就直接继续
 				if (coins[j] > i) {
 					continue;
 				}
+				// 如果该值等于-1，直接继续
 				if (dp[i - coins[j]] == -1) {
 					continue;
 				}
+				// 状态转移方程
 				dp[i] = 1 + dp[i - coins[j]];
 				res = Math.min(res, dp[i]);
 			}
+			// 取出dp中最小的一个
 			dp[i] = res;
 		}
+		// 然后返回dp[amount]
 		return dp[amount];
 	}
 }
Original file line number	Diff line number	Diff line change
`@@ -30,17 +30,22 @@ private int CoinChange(int[] coins, int amount) {`
`30`	`30`	`for (int i = 1; i <= amount; i++) {`
`31`	`31`	`int res = Integer.MAX_VALUE;`
`32`	`32`	`for (int j = 0; j < coins.length; j++) {`
	`33`	`+ // 如果该值大于i，就直接继续`
`33`	`34`	`if (coins[j] > i) {`
`34`	`35`	`continue;`
`35`	`36`	`}`
	`37`	`+ // 如果该值等于-1，直接继续`
`36`	`38`	`if (dp[i - coins[j]] == -1) {`
`37`	`39`	`continue;`
`38`	`40`	`}`
	`41`	`+ // 状态转移方程`
`39`	`42`	`dp[i] = 1 + dp[i - coins[j]];`
`40`	`43`	`res = Math.min(res, dp[i]);`
`41`	`44`	`}`
	`45`	`+ // 取出dp中最小的一个`
`42`	`46`	`dp[i] = res;`
`43`	`47`	`}`
	`48`	`+ // 然后返回dp[amount]`
`44`	`49`	`return dp[amount];`
`45`	`50`	`}`
`46`	`51`	`}`