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 votes130 views1 answer
Gcd of two numbers c++
C++
1 vote190 views1 answer
C++ visual studio 19 how to make colord button from code
C++
0 vote172 views1 answer
C++ put a function in a other thread
C++
-2 votes114 views1 answer
Uses of c++
C++
-1 vote113 views2 answers
Function template c++
C++
5 votes124 views6 answers
Binary search algorithm
C++
-1 vote115 views1 answer
Easy c++ code
C++
10 votes122 views2 answers
Difference between programming and coding
C++
4 votes119 views3 answers
Converting char to int in c++
C++
5 votes104 views5 answers
How to convert char to int in c++
C++