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 vote162 views1 answer
Advanced c++ topics
C++
0 vote174 views1 answer
Bit masking tricks
C++
0 vote173 views1 answer
How to rotate canvas android
C++
0 vote193 views1 answer
Inpout in Array c++
C++
1 vote182 views1 answer
G++ optimization flags
C++
-2 votes190 views4 answers
Function Template in c++
C++
0 vote190 views1 answer
Vprintf
C++
1 vote167 views1 answer
Linerenderer follow camera unity
C++
0 vote157 views1 answer
Print pattern and space in cpp
C++
0 vote168 views1 answer
Initialize a vector with another vector c++ complexity
C++