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 vote152 views1 answer
Find the biggest element in the array
C++
0 vote146 views3 answers
Online convert c++ code to assembly language
C++
10 votes143 views2 answers
Why convert char* to string c++
C++
0 vote175 views1 answer
Compile in c++
C++
0 vote131 views10 answers
Python to c++ transpiler
C++
0 vote146 views1 answer
How to sort array in c++ stockoverflow
C++
10 votes159 views2 answers
Ascii cpp
C++
1 vote137 views1 answer
How to send email in c++ program
C++
1 vote150 views1 answer
Restting a queue stl
C++
0 vote141 views3 answers
Dynamic memory c++
C++