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 vote121 views1 answer
Implicit conversion casting
C++
5 votes123 views1 answer
What library to mention for swap function in c++
C++
7 votes113 views1 answer
Insert at position in vector c++
C++
0 vote133 views1 answer
C++ vector push if not exist
C++
3 votes128 views2 answers
All of the stars lyrics
C++
8 votes118 views2 answers
Check variable type c++
C++
0 vote111 views1 answer
C++ set count
C++
0 vote116 views1 answer
Ala vida
C++
0 vote136 views1 answer
To toggle (flip the status of) the k-th item of the set
C++
-1 vote121 views4 answers
How to say hello world in c++
C++