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 vote337 views1 answer
++ how to write quotation mark in a string
C++
0 vote458 views1 answer
Changing values of mat in opencv c++
C++
23 votes327 views6 answers
Team fortress
C++
0 vote355 views1 answer
Constexpr std::round c++
C++
-1 vote362 views1 answer
How to declare a function in c++ header file
C++
0 vote349 views1 answer
Stl
C++
5 votes326 views4 answers
C++ remove whitespace from string
C++
-1 vote310 views1 answer
Permutation c++
C++
10 votes315 views3 answers
What is pi
C++
0 vote346 views1 answer
Tabeau pseudo dynamique sur c++
C++