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 vote298 views1 answer
Cpp set time
C++
5 votes294 views1 answer
Best clips recording software for cs go
C++
0 vote1.1K views1 answer
Cout c++
C++
10 votes321 views2 answers
Check if char in string c++
C++
0 vote284 views2 answers
Change colour of output to terminal c++
C++
0 vote286 views1 answer
C++ print to standard error
C++
0 vote296 views1 answer
C++ split string by several space
C++
0 vote285 views1 answer
Run program until ctrl-d c++
C++
1 vote295 views1 answer
C++ string not printing
C++
4 votes294 views1 answer
Gcd of two numbers c++
C++