目录
牛客_JD1 年终奖
解析代码
#include <vector>
class Bonus {
public:
int getMost(vector<vector<int> > board) {
int m = board.size(), n = board[0].size();
vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));
for(int i = 1; i <= m; ++i)
{
for(int j = 1; j <= n; ++j)
{
dp[i][j] = max(dp[i-1][j], dp[i][j-1]) + board[i-1][j-1];
}
}
return dp[m][n];
}
};