Maximum subarray leetcode c++

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int max_sum = INT_MIN;
        int sum = 0;

        for(int i = 0; i < nums.size(); i++){
           sum += nums[i];

            if(max_sum < sum){
                max_sum = sum;
            }

            if(sum < 0){
                sum = 0;
            }
        }

        return max_sum;
    }
};

Source: alkeshghorpade.me

Similar codes

0 vote246 views1 answer
PUBG_APIKEY=<your-api-key> npm t
C++
1 vote248 views1 answer
Rank() in c++
C++
3 votes261 views2 answers
Last element of a set in c++
C++
148 votes336 views10 answers
Grepper
C++
0 vote266 views1 answer
Stack implementation
C++
4 votes213 views1 answer
Cin statement c++
C++
23 votes225 views2 answers
C++ user input
C++
0 vote198 views7 answers
C++ convert to c online
C++
0 vote222 views1 answer
Initialize a vector with another vector c++ complexity
C++
0 vote230 views1 answer
Why do men drink liquor
C++