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 vote269 views1 answer
Disabling console exit button c++
C++
9 votes276 views2 answers
Fast io
C++
0 vote272 views1 answer
How to clear a string in c++
C++
0 vote329 views1 answer
Play audio c++
C++
2 votes296 views1 answer
C++ compare strings ignore case
C++
0 vote292 views1 answer
C++ typedef template class
C++
-1 vote278 views1 answer
A[12] = h + A[8]
C++
0 vote298 views1 answer
Stl reverse sort a array
C++
-1 vote306 views5 answers
Memset in c++
C++
1 vote283 views1 answer
Roscpp publish int32
C++