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
Difference between --a and a-- c++
C++
1 vote325 views1 answer
How to check is some number is divisible by 3 in c++
C++
0 vote318 views1 answer
Zsh: segmentation fault ./provided_files.exe erosion X \.
C++
1 vote348 views1 answer
C++ 20 struct initialization
C++
0 vote325 views1 answer
Insert only unique values into vector
C++
0 vote320 views1 answer
Surf interpolation matlab
C++
-1 vote350 views5 answers
Memset in cpp
C++
0 vote327 views1 answer
Input full line as input in cpp
C++
3 votes301 views1 answer
Loop over multidimensional array c++
C++
1 vote318 views1 answer
Integer type validation c++
C++