LeetCode作业：Maximum Subarray

题目原址：点击打开链接 

题目描述：

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [-2,1,-3,4,-1,2,1,-5,4],the contiguous subarray [4,-1,2,1] has the largest sum =6.

我的代码：

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