Leetcode-DP-Coing Change 2

class Solution:
    def change(self, amount: int, coins: List[int]) -> int:
        m=len(coins)+1
        n=amount+1
        dp=[[0]*n for i in range(m)]
        dp[0][0]=1
        for i in range(1,m):
            for j in range(n):
                if j-coins[i-1]<0:
                    dp[i][j]=dp[i-1][j]
                else:
                    dp[i][j]=dp[i][j-coins[i-1]]+dp[i-1][j]
        return dp[-1][-1]
        

https://www.youtube.com/watch?v=DJ4a7cmjZY0