[OJ.leetcode] maximum-subarray

https://oj.leetcode.com/problems/maximum-subarray/

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(int A[], int n) { if(n == 1) return A[0]; int maxSum = A[0]; int currSum = 0; for(int i=0; i<n ; i++) { currSum += A[i]; if(currSum > maxSum) maxSum = currSum; if(currSum < 0) currSum = 0; } return maxSum; } };