摘要: 1 class Solution { 2 public int integerBreak(int n) { 3 int[] dp = new int[n + 1]; //动态数组 4 for (int i = 2; i <= n; i++) { 5 for (int j = 1; j < i; j+ 阅读全文
posted @ 2020-07-30 22:48 小小码农-安 阅读(165) 评论(0) 推荐(0) 编辑