50.45%
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int maxSum=nums[0];
int dp[nums.size()];//以当前字符串为最后一个字符串的子字符串最大和
dp[0]=nums[0];
for (int i=1;i<nums.size() ;i++ )
{
dp[i]=nums[i]+(dp[i-1]>0?dp[i-1]:0);
maxSum=max(dp[i],maxSum);
}
return maxSum;
}
};
50.45%
题目描述 Maximum subarray sumThe maximum sum subarray problem...
53. Maximum Subarray Find the contiguous subarray within ...
53. Maximum Subarray Find the contiguous subarray within ...
**Maximum Subarray **（最基本的）Find the contiguous subarray w...
title: Maximum Subarraytags:- maximum-subarray- No.53- si...
Maximum Subarray：https://leetcode.com/problems/maximum-su...
152. Maximum Product Subarray
Maximum Average Subarray I - LeetCode algorithm - array 这...
LeetCode 152. Maximum Product Subarray Description Given ...
本文标题：Leetcode53. Maximum Subarray
本文链接：https://www.haomeiwen.com/subject/pjpkhxtx.html
网友评论