摘要:
1 /** 2 * Definition for a binary tree node. 3 * public class TreeNode { 4 * int val; 5 * TreeNode left; 6 * TreeNode right; 7 * TreeNode(int x) { val 阅读全文
posted @ 2020-07-28 23:02
小小码农-安
阅读(133)
评论(0)
推荐(0)
摘要:
1 class Solution { 2 public int splitArray(int[] nums, int m) { 3 int len = nums.length; 4 int[][] dp = new int[len + 1][m + 1]; //动态规划数组,dp[i][j]代表前i 阅读全文
posted @ 2020-07-28 22:41
小小码农-安
阅读(173)
评论(0)
推荐(0)

浙公网安备 33010602011771号