Maximum Subarray - Leetcode Solution

//Kadane's Algorithmclass Solution {public:    int maxSubArray(vector<int>& nums) {        int ans =INT_MIN,sum =0;        int n=nums.size();        for(int i=0;i<n;++i){           sum+=nums[i];           ans = max(ans,sum);        if(sum<0)            sum=0;        }        return ans;        }      };