LeetCode – Refresh – Maximal Subarray

class Solution {
public:
    int maxSubArray(int A[], int n) {
        int result = A[0], sum = A[0];
        for (int i = 1; i < n; i++) {
            sum = max(sum + A[i], A[i]);
            result = max(result, sum);
        }
        return result;
    }
};

 

I find the 2D matrix solution:

http://www.geeksforgeeks.org/dynamic-programming-set-27-max-sum-rectangle-in-a-2d-matrix/