LeetCode (Maximum Subarray)

Problem:

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.

Solution:

class Solution {public:    int maxSubArray(vector<int>& nums) {        int ans = INT_MIN, sum = 0;        for(int n : nums){            sum = max(sum + n, n);            ans = max(sum, ans);        }        return ans;    }};