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 vote298 views1 answer
Get map values c++
C++
37 votes347 views2 answers
Remove element by index from vector c++
C++
0 vote248 views1 answer
C code to c++ converter
C++
1 vote261 views1 answer
Have unique vector after sorting vector
C++
1 vote283 views1 answer
Heap c++ stl
C++
1 vote280 views10 answers
Test
C++
19 votes276 views1 answer
C++ files
C++
0 vote224 views1 answer
Recuva recovery software for pc with crack
C++
0 vote279 views1 answer
Compile and run cpp file on mac c++
C++
1 vote272 views1 answer
Random number of 0 or 1 c++
C++