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
原创
2020-10-22 16:08:20 ·
65 阅读 ·
0 评论