【动态规划】珠宝的最高价值

题目链接https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/description/classSolution{public:intjewelleryValue(vectorvectorintframe){/*时空复杂度O(mn)*/intmframe.size(),nframe[0].size();// 1. 创建dp表vectorvectorintdp(m1,vectorint(n1));// 2. 初始化// 3. 填表for(inti1;im;i)for(intj1;jn;j)dp[i][j]max(dp[i-1][j],dp[i][j-1])frame[i-1][j-1];// 4. 返回值returndp[m][n];}};