C++ | Leetcode C++题解之第312题戳气球
题目:https://i-blog.csdnimg.cn/direct/b66eecdd4b594df6bcdfe8a8cca3be1c.png
题解:
class Solution {
public:
int maxCoins(vector<int>& nums) {
int n = nums.size();
vector<vector<int>> rec(n + 2, vector<int>(n + 2));
vector<int> val(n + 2);
val = val = 1;
for (int i = 1; i <= n; i++) {
val = nums;
}
for (int i = n - 1; i >= 0; i--) {
for (int j = i + 2; j <= n + 1; j++) {
for (int k = i + 1; k < j; k++) {
int sum = val * val * val;
sum += rec + rec;
rec = max(rec, sum);
}
}
}
return rec;
}
};
免责声明:如果侵犯了您的权益,请联系站长,我们会及时删除侵权内容,谢谢合作!更多信息从访问主页:qidao123.com:ToB企服之家,中国第一个企服评测及商务社交产业平台。
页:
[1]