week 5 322. Coin Change

public class Solution {
    public int coinChange (int[] coins, int amount) {
    if (amount <= 0){
        return 0;
    }   
    int [] dp = new int[amount + 1];
    Arrays.fill(dp, integer.MAX_VALUE);
    Arrays.sort(coins);
    dp[0] = 0;
        
    for(int i = 1; i <= amount; i++){
        for(int coin : coins){
            if(coin > i){
                break;
            }
            if(dp[i - coin] != Integer.MAX_VALUE){
                dp[i] = Math.min(dp[i], dp[i-coin] + 1);
            }
        }
    }
    
    return dp[amount] == Integer.MAX_VALUE ? -1 : dp[amount];
    
}
}