class Solution {
public:
int maxSubArray(int A[], int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int ret = A[0];
int sum = 0;
for (int i = 0; i < n; i++) {
sum < 0 ? sum = A[i] : sum += A[i];
ret = max(ret, sum);
}
return ret;
}
};
Small Case: 4ms
Large Case: 44ms
Time: O(n)
Space: O(1)