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 vote309 views1 answer
How to create a min priority queue of pair of int, int
C++
0 vote334 views10 answers
Python to c++ transpiler
C++
21 votes337 views3 answers
C++ last element of vector
C++
19 votes320 views1 answer
Access last element in vector in c++
C++
5 votes343 views2 answers
Delete specific row from dynamic 2d array c++
C++
0 vote382 views1 answer
Euler constant
C++
13 votes313 views4 answers
Stl sort in c++
C++
0 vote327 views1 answer
C++ typeid get type name
C++
1 vote306 views1 answer
BAPS
C++
0 vote311 views1 answer
Qt background color
C++