maximum_sub_array_dp.cpp

/*
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [-2,1,-3,4,-1,2,1,-5,4],
the contiguous subarray [4,-1,2,1] has the largest sum = 6.
*/


class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int max_sum = 0;
        int local_max_sum = 0;
        
        
        for(int i = 0;i<nums.size();i++)
        {
            if(i==0)
            {
                max_sum=nums[i];
                local_max_sum=nums[i];
            }
            else
            {
                local_max_sum = max(nums[i],local_max_sum + nums[i]);
                max_sum = max(max_sum,local_max_sum);
                
            }
        }
        return max_sum;
    }
};