class Solution
{
public:
int maxSubArray(vector<int>& nums)
{
int maxSum = INT32_MIN;
int count = 0;
for (int i = 0; i < nums.size(); i++)
{
count += nums[i];
if (count > maxSum)
maxSum = count;
if (count < 0) count = 0;
}
return maxSum;
}
};
LeetCode53. 最大子序和
于 2024-06-22 09:45:16 首次发布