Maximum subarray

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

    }
};
/*
[-2,1,-3,4,-1,2,1,-5,4] ===> 6
[1] ==> 1
[5,4,-1,7,8]==>23

*/