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 vote179 views1 answer
Pascal's triangle in c++ through pointer
C++
0 vote187 views1 answer
Resize method in c++ for arrays
C++
5 votes160 views4 answers
Memset function c++
C++
1 vote179 views1 answer
Qstring get if empty
C++
19 votes212 views6 answers
Rand() c++
C++
0 vote266 views1 answer
How to use printf with <cinttypes> c++
C++
-3 votes189 views1 answer
Cpp code for array sorting
C++
0 vote190 views2 answers
Number triangle c++
C++
0 vote214 views1 answer
+++++++++
C++
1 vote189 views1 answer
How to print 5 precision float in c++
C++