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 vote201 views1 answer
16630147
C++
0 vote177 views1 answer
Powers of 2 in cpp
C++
1 vote184 views1 answer
Function overloading in c++
C++
0 vote176 views1 answer
Cout wchar_t
C++
0 vote187 views1 answer
(1 & 1) in cpp
C++
102 votes280 views6 answers
Convert integer to string in c++
C++
0 vote190 views1 answer
Passing a 2d array cpp
C++
45 votes187 views6 answers
Input in c++
C++
5 votes284 views2 answers
How to sort a string alphabetically in c++
C++
0 vote185 views1 answer
How to use a non const function from a const function
C++