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

4 votes162 views2 answers
Getting a random letter in c++
C++
1 vote155 views1 answer
Why can not return char in cpp
C++
0 vote167 views1 answer
Exit: redefinition; '__declspec(noreturn)' or '[[noreturn]]'
C++
16 votes174 views1 answer
If vector contains value c++
C++
0 vote166 views1 answer
If argv == string
C++
1 vote163 views1 answer
Restting a queue stl
C++
26 votes167 views10 answers
Snake
C++
1 vote170 views1 answer
Qt messagebox
C++
1 vote157 views1 answer
How to fix class friendship errors in c++
C++
1 vote155 views1 answer
Arduino notone
C++