Maximum Subarray LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maxSubArray(vector<int> &nums) {
4
    int m = INT_MIN, sm = 0;
5
    for (int i = 0; i < nums.size(); ++i) {
6
      sm += nums[i];
7
      m = max(sm, m);
8
      if (sm < 0) sm = 0;
9
    }
10
    return m;
11
  }
12
};