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

1 vote137 views1 answer
Word equation numbers
C++
0 vote169 views1 answer
Sort vector of strings
C++
21 votes141 views5 answers
Print in c++
C++
1 vote136 views1 answer
Convert whole string to lowercase c++
C++
0 vote141 views1 answer
Call to constructor of 'extClockType' is ambiguous extClockType time2;
C++
0 vote157 views3 answers
Best gun in freefire for headshot
C++
0 vote145 views1 answer
Advanced c++ topics
C++
0 vote134 views1 answer
Difference between --a and a-- c++
C++
104 votes291 views6 answers
Integer to string c++
C++
0 vote189 views1 answer
Operator overloading outside class
C++