[LeetCode Python3/C++] 53. Maximum Subarray

Python3 Solution:

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        if not nums:
            return 0
        sums, res = 0, nums[0]
        for num in nums:
            sums = max(sums + num, num)
            res = max(res,sums)
        return res

C++ Solution:

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        if(nums.size() == 0)
            return 0;
        int sum = 0, res = nums[0];
        for(int i = 0; i < nums.size(); i++){
            sum = max(sum+nums[i], nums[i]);
            res = max(sum, res);
        }
        return res; 
    }
};