【問題描述】[困難]

【解答思路】

1. 遞歸 動態(tài)規(guī)劃

class Solution {public int removeBoxes(int[] boxes) {int[][][] dp = new int[100][100][100];return calculatePoints(boxes, dp, 0, boxes.length - 1, 0);}public int calculatePoints(int[] boxes, int[][][] dp, int l, int r, int k) {if (l > r) return 0;if (dp[l][r][k] != 0) return dp[l][r][k];//優(yōu)化 找到相等的就切 while (r > l && boxes[r] == boxes[r - 1]) {r--;k++;}dp[l][r][k] = calculatePoints(boxes, dp, l, r - 1, 0) + (k + 1) * (k + 1);for (int i = l; i < r; i++) {if (boxes[i] == boxes[r]) {dp[l][r][k] = Math.max(dp[l][r][k], calculatePoints(boxes, dp, l, i, k + 1) + calculatePoints(boxes, dp, i + 1, r - 1, 0));}}return dp[l][r][k];} }

細(xì)節(jié)理解 通俗易解的圖 要把中間那塊抽出來 單獨(dú)遞歸

圖解二 宏觀理解

【總結(jié)】

1. 遞歸+動態(tài)規(guī)劃 鍛煉抽象思維

2.難難難

轉(zhuǎn)載鏈接：https://leetcode-cn.com/problems/remove-boxes/solution/yi-chu-he-zi-by-leetcode-solution/
參考鏈接：https://leetcode-cn.com/problems/remove-boxes/solution/guan-fang-fang-fa-2ji-yi-hua-sou-suo-dong-hua-tu-j/
參考鏈接：https://leetcode-cn.com/problems/remove-boxes/solution/guan-fang-ti-jie-de-tu-jie-by-xiayilive/

總結(jié)

以上是生活随笔為你收集整理的[Leetcode][第546题][JAVA][移除盒子][递归][动态规划]的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。