maximumSubarray.md

class Solution { public: int maxSubArray(vector& nums) { int max_sum=INT_MIN, curr_sum=0; for(int i=0;i<nums.size();i++){ curr_sum+=nums[i]; if(curr_sum>max_sum) max_sum=curr_sum;

        if(curr_sum<0)
            curr_sum=0;
    }
    return max_sum;
}

};