lincode.41 最大子数组

class Solution {
public:
    /*
     * @param nums: A list of integers
     * @return: A integer indicate the sum of max subarray
     */
    int maxSubArray(vector<int> &nums) {
        // write your code here
        int s=nums.size();
        int res=nums[0];
        int cn=0;
        for(int i =0;i<s;i++){
            cn+=nums[i];
            if(res<cn)
                res=cn;
            if(cn<0)
                cn=0;
        }
        return res;
    }
};