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 vote298 views1 answer
What does map.count() return in c++
C++
0 vote313 views1 answer
Statement that causes a function to end in c++
C++
3 votes280 views1 answer
Convert refference to pointer c++
C++
0 vote300 views1 answer
C++ static array in Klasse
C++
0 vote285 views1 answer
Strcmp in c++ header file
C++
0 vote307 views1 answer
Getline(cin string) not working
C++
0 vote334 views1 answer
ViewController import
C++
0 vote282 views1 answer
Ordine crescente "senza" vettori in c++
C++
0 vote327 views1 answer
ALO
C++
0 vote345 views2 answers
Dynamic memory allocation c++
C++