- 博客(2)
- 收藏
- 关注
RSS订阅原创 leetcode : 312. Burst Balloons : dp矩阵加括号
public class Solution { public int maxCoins(int[] nums) { int n=nums.length; int[] tnums=new int[n+2]; int[][]maxdp=new int[n+2][n+2]; System.arraycopy(nums, 0, tnums, 1, n); tnums[0]=1;
2016-04-14 21:12:01
636
原创 leetcode : 312. Burst Balloons : dp矩阵加括号
312. Burst BalloonsMy SubmissionsQuestionEditorial SolutionTotal Accepted: 7739 Total Submissions: 21379 Difficulty: HardGiven n balloons, indexed from 0 to n-1. Each ballo
2016-04-14 21:03:31
116
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人