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

7 votes160 views2 answers
System cls c
C++
0 vote178 views1 answer
C++ read each char of string
C++
2 votes175 views5 answers
How to sort a vector
C++
3 votes163 views1 answer
How to convert qt string to string
C++
45 votes207 views6 answers
Input in c++
C++
7 votes231 views1 answer
Nearest integer rounding in c++
C++
1 vote182 views1 answer
C++ ros publisher
C++
0 vote187 views1 answer
Array copx c++
C++
0 vote165 views1 answer
C++ unittest in ros
C++
22 votes132 views18 answers
Pointers in c++
C++