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

-1 vote194 views2 answers
Why is my unity crashing
C++
1 vote188 views1 answer
Leveling system c++
C++
3 votes188 views3 answers
Map in cpp
C++
0 vote178 views1 answer
Convert string to wide string
C++
1 vote197 views1 answer
How to loop a 2 dimensional vector in c++ starting from second element
C++
0 vote204 views1 answer
C++ if bool true
C++
1 vote162 views1 answer
C++ get input without loop
C++
0 vote187 views1 answer
How to get a section of a string in c++
C++
3 votes271 views2 answers
Convert whole string to uppercase c++
C++
0 vote256 views2 answers
Dynamic memory allocation c++
C++