问题遇到的现象和发生背景
力扣
https://leetcode-cn.com/problems/maximum-subarray/
问题相关代码,请勿粘贴截图
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int size = nums.size();
int dp[size][size]; //dp数组表明前面存储的元素的和
int sum = 0;
for(int i = 0;i<size;i++) //对元素进行初始化
dp[i][0] = sum+nums[i];
int max = dp[0][0];
for(int j = 1;j<size;j++){
for(int i = 0;i<=j;i++){
dp[i][j] = dp[i][j-1] + nums[i];
if(dp[i][j] > max)
max = dp[i][j];
}
}
return max;
}
};