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

5 votes255 views1 answer
How to print list in c++
C++
0 vote260 views1 answer
User inptu in cpp
C++
1 vote251 views1 answer
Save all output in log file c cpp
C++
8 votes265 views3 answers
C++ min
C++
0 vote310 views1 answer
Stack implementation
C++
1 vote284 views1 answer
How to take user input in a client server program in c++
C++
0 vote262 views1 answer
C++ fast
C++
0 vote255 views1 answer
Choose endianness in cpp
C++
1 vote251 views1 answer
OPA in expanse
C++
0 vote257 views2 answers
\0 in c++
C++