53. Maximum Subarray

来源:互联网 发布:网络黑白txt百度云盘 编辑:程序博客网 时间:2024/05/19 00:41
class Solution {public:    int maxSubArray(vector<int>& nums) {        int sum = 0,  max_sum = 0x80000000;        for(auto i : nums){            if(sum >= 0)                sum += i;            else                sum = i;            if(sum > max_sum)                max_sum = sum;        }        return max_sum == 0x80000000? 0 : max_sum;    }};