https://leetcode.com/problems/maximum-subarray/
class Solution {
public:
int maxSubArray(vector<int>& nums) {
long long temp=0, sums=INT_MIN;
for (int i=0; i<nums.size(); i++)
{
if (temp<=0)
{
temp=nums[i];
}
else
{
temp=temp+nums[i];
}
if (temp>sums)
{
sums=temp;
}
cout<<temp<<endl;
}
return sums;
}
};