[leetcode]Maximum Subarray

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