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 vote189 views1 answer
C++ rgb code
C++
0 vote205 views1 answer
How to install opencv c++ on windows vscode
C++
2 votes221 views2 answers
Back() in c++
C++
0 vote193 views1 answer
Opengl draw semi circle c++
C++
0 vote206 views1 answer
C2079 'stream' uses undefined class 'std::basic_ifstream<char,std::char_traits<char>>'
C++
0 vote189 views1 answer
Why the << operator is friend
C++
3 votes214 views2 answers
Set precision in c++ no decimal places\
C++
1 vote194 views1 answer
Gestd::getline with wstring
C++
0 vote191 views1 answer
Dream speedrun song mp4
C++
0 vote209 views1 answer
Get player pawn
C++