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 vote271 views1 answer
Factore of 20 in c+
C++
0 vote231 views2 answers
Sort using comparator anonymous function c++
C++
3 votes281 views2 answers
C++ first letter of string
C++
3 votes186 views2 answers
C++ read text file
C++
0 vote182 views1 answer
Cpp function that returns two arguments
C++
0 vote222 views1 answer
C++ pause linux
C++
0 vote237 views1 answer
Ue4 get size of viewport c++
C++
11 votes219 views1 answer
Removing a character from a string in c++
C++
1 vote230 views1 answer
Qstring get if empty
C++
0 vote228 views1 answer
Get spaces in cin c++
C++