求教:刚做完完美世界第一题的动态规划,只过88.89,看不出来哪里有数组越界. public int maximumTotal (int[][] triangle) { // write code here int ceng = triangle.length; int ans = 0; int[][] dp = new int[ceng][ceng]; dp[0][0]= triangle[0][0]; // index[0] = 0; for (int i = 1; i < ...