leetcode53 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 size=nums.size();
        int ans=0;
        if(size<0)
            return ans;
        ans=nums[0];
        int temp=ans;
        for(int i=1;i<size;i++)
        {
            if(temp<0)
            {
                temp=nums[i];
            }
            else
            {
                temp+=nums[i];
            }
            if(temp>ans)
                ans=temp;
        }
        return ans;
    }
};