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

8 votes326 views5 answers
Resize vector c++
C++
0 vote327 views1 answer
How to adjust and delete memory in c, c++
C++
8 votes328 views3 answers
C++ min
C++
1 vote318 views1 answer
How to fix class friendship errors in c++
C++
0 vote428 views1 answer
C++ convert const char* to int
C++
0 vote323 views1 answer
How to declare a vector of int in c++
C++
0 vote377 views1 answer
Convert unsigned long to string c++
C++
0 vote288 views1 answer
The five most significant revisions of the C++ standard are C++98 (1998), C++03 (2003) and C++11 (2011), C++14 (2014) and C++17 (2017)
C++
0 vote349 views1 answer
Properties of loop in c++ and how it works
C++
0 vote399 views1 answer
Deletion in bst
C++