題解Java

class Solution {public int[][] rec;public int[] val;public int maxCoins(int[] nums) {int n = nums.length;val = new int[n + 2];for (int i = 1; i <= n; i++) {val[i] = nums[i - 1];}val[0] = val[n + 1] = 1;rec = new int[n + 2][n + 2];for (int i = 0; i <= n + 1; i++) {Arrays.fill(rec[i], -1);}return solve(0, n + 1);}public int solve(int left, int right) {if (left >= right - 1) {return 0;}if (rec[left][right] != -1) {return rec[left][right];}for (int i = left + 1; i < right; i++) {int sum = val[left] * val[i] * val[right];sum += solve(left, i) + solve(i, right);rec[left][right] = Math.max(rec[left][right], sum);}return rec[left][right];} }

總結

以上是生活随笔為你收集整理的LeetCode_每日一题今日份_312.戳气球（没懂）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。