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 vote107 views1 answer
What is a .cpp file
C++
0 vote111 views1 answer
C++ getline doesn't wait for input
C++
19 votes83 views5 answers
C++ how to generate a random number in a range
C++
0 vote105 views1 answer
Passing 2d array by reference c++
C++
1 vote107 views1 answer
Cpp std list example
C++
2 votes100 views2 answers
C++ int to qstring
C++
0 vote94 views1 answer
C code to c++ converter
C++
1 vote128 views1 answer
Master header file c++
C++
0 vote103 views1 answer
PascalName seperate strings
C++
0 vote96 views1 answer
Qt insert image in widget
C++