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 vote152 views1 answer
Ejemplo
C++
1 vote183 views1 answer
Separation between paragraphs latex
C++
0 vote137 views1 answer
C++ sort numbers by magnitude/absolute value
C++
0 vote184 views3 answers
C++ program to convert celsius to kelvin
C++
1 vote183 views1 answer
C++ builder
C++
0 vote161 views1 answer
How to implement binders and decorators on c++ lik python?
C++
0 vote134 views1 answer
C++ looping through a vector
C++
0 vote150 views1 answer
Emplace vs push c++
C++
0 vote144 views2 answers
QVariant to int
C++
0 vote183 views1 answer
C++ write string
C++