class Solution {
public:
int maxSubArray(vector<int>& nums) {
const int N=1e5+10;
int dp[N];
dp[0]=-0x3f3f3f3f;
int ans=-0x3f3f3f3f;
for(int i=1;i<=nums.size();i++)
{
dp[i]=max(nums[i-1]+dp[i-1],nums[i-1]);
ans=max(ans,dp[i]);
}
return ans;
}
};
LeetCode 53
最新推荐文章于 2024-06-12 10:00:23 发布