class Solution {
public:
int maxSubArray(vector& nums) {
if(nums.size()==0){
return 0;
}
int sum_max=nums[0];
int sum_including_curr=nums[0];
// for(int n:nums)
for(int i=1;i<nums.size();i++)
{
int n=nums[i];
sum_including_curr=max(sum_including_curr+n,n);
sum_max=max(sum_including_curr,sum_max);
}
return sum_max;
}};
Comments (0)
