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

12 votes326 views1 answer
Create copy constructor c++
C++
2 votes344 views1 answer
Sfml draw tex
C++
0 vote345 views1 answer
What is blob in computer vision
C++
0 vote336 views1 answer
>> c++
C++
1 vote348 views1 answer
Iterate vector from end to begin
C++
3 votes385 views2 answers
How to get last element of set
C++
1 vote348 views1 answer
G++ compile c++11
C++
1 vote346 views3 answers
Comment in c++
C++
0 vote340 views1 answer
Std::ifstream cant read file to large
C++
14 votes362 views4 answers
C++ define vector with size
C++