53. Maximum Subarray

Kadane’s Algorithm

class Solution {
public:
    int maxSubArray(vector<int>& nums)
    {
        int curSum = 0;
        int maxSum = INT_MIN;
        for (int num : nums)
        {
            curSum = max(num, curSum + num);
            maxSum = max(maxSum, curSum);
        }
        return maxSum;
    }
};

• T: $O(N)$
• S: $O(1)$