Coin Change 2 LeetCode solution in Java

1
class Solution {
2
  public int change(int amount, int[] coins) {
3
    int[] dp = new int[amount + 1];
4
    // for each coin iteration : dp[i] = number of coins required to make i with coins [0...coin]
5
    dp[0] = 1;
6
    for (int coin : coins) {
7
      for (int i = coin; i <= amount; i++) {
8
        dp[i] += dp[i - coin];
9
      }
10
    }
11
    return dp[amount];
12
  }
13
}