class Solution {
public:
int maxFun(int a, int b)
{
return a > b ? a : b;
}
int maxSubArray(vector<int>& nums) {
if (nums.size() == 0)
{
return 0;
}
int max = nums[0], dp = nums[0];
for (int i = 1; i < nums.size();i++)
{
dp = maxFun(nums[i] + dp, nums[i]);
max = maxFun(dp, max);
}
return max;
}
};
LeetCode面试题 16.17. 连续数列
最新推荐文章于 2023-11-05 22:50:25 发布