Leetcode算法题-动态规划

面试题 08.11. 硬币

https://leetcode-cn.com/problems/coin-lcci/

class Solution { public int waysToChange(int n) { int[] nums = {1,5,10,25}; long[][] dp = new long[5][n + 1]; for (int i = 0; i < 4; i++) { dp[i][0] = 1; for (int j = 0; j <= n; j++) { if (j >= nums[i]) dp[i + 1][j] = dp[i][j] + dp[i + 1][j - nums[i]]; else dp[i + 1][j] = dp[i][j]; } } return (int) (dp[4][n] % 1000000007); } }