322. 零钱兑换
// dp[i]=min dp[i-cj]+1
// dp[i]表示达到i金额所需的最小硬币数
// cj表示第j枚硬币的面值
class Solution {
public int coinChange(int[] coins, int amount) {
Arrays.sort(coins);
int[] dp = new int[amount + 5];
Arrays.fill(dp, amount + 1);
dp[0] = 0;
for (int i = 1; i <= amount; i++) {
for (int j = 0; j < coins.length && i - coins[j] >= 0; j++) {
dp[i] = Math.min(dp[i], dp[i - coins[j]]+ 1);
}
}
return dp[amount] <= amount ? dp[amount] : -1;
}
}