【Leetcode】53. Maximum Subarray

题目地址：

https://leetcode.com/problems/maximum-subarray/

给定一个长$n$的整型数组，求和最大的非空子数组的和。

设$f(a_0,a_1,...,a_n)$为向量$(a_0,a_1,...,a_n)$的最大子数组和，而$g(a_0,a_1,...,a_n)$为向量$(a_0,a_1,...,a_n)$的以$a_n$为结尾的最大子数组和。算法可以由下面的递推方程得到： f ( a 0 , a 1 , . . . , a n ) = max ⁡ k ∈ { 0 , 1 , . . . , n } g ( a 0 , a 1 , . . . , a k ) g ( a 0 , a 1 , . . . , a k ) = { a 0 ,   k = 0 max ⁡ ( 0 , g ( a 0 , a 1 , . . . , a k − 1 ) ) + a k ,   k > 0 f(a_0,a_1,...,a_n)=\max_{k\in \{0,1,...,n\}}g(a_0,a_1,...,a_k)\\ g(a_0,a_1,...,a_k)=\begin{cases}a_0,\ k = 0\\\max(0,g(a_0,a_1,...,a_{k-1}))+a_k,\ k>0\end{cases} f(a0​,a1​,...,an​)=k∈{0,1,...,n}max​g(a0​,a1​,...,ak​)g(a0​,a1​,...,ak​)={a0​, k=0max(0,g(a0​,a1​,...,ak−1​))+ak​, k>0​代码如下：

class Solution {
 public:
  int maxSubArray(vector<int>& a) {
    int res = -2e9, cur_sum = 0;
    for (int x : a) {
      cur_sum = max(x, cur_sum + x);
      res = max(res, cur_sum);
    }
    return res;
  }
};

时间复杂度$O(n)$，空间$O(1)$。