Maximum Subarray

class Solution {
public:
    int maxSubArray(int A[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int result;
        if (n == 0) return result;
        
        vector <int> record(n,0);
        record[0] = A[0];
        result = record[0];
        
        for (int i=0; i<n-1; i++){
            
            record[i+1] = max(record[i]+A[i+1], A[i+1]);
            if (record[i+1] > result) result = record[i+1];
        }
        
        return result;
    }
};