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 vote177 views1 answer
How to convert int to FString c++ ue4
C++
0 vote271 views1 answer
Prisma client
C++
0 vote193 views1 answer
Bash find into array
C++
0 vote196 views1 answer
Cin does not wait for input
C++
0 vote209 views1 answer
Esp
C++
2 votes169 views1 answer
Allocation an array with new cpp
C++
0 vote184 views1 answer
All usefull stls in cpp imports
C++
0 vote186 views1 answer
How-to-read-until-eof-from-cin-in-c++
C++
5 votes207 views2 answers
Vbs check if file exists
C++
1 vote184 views1 answer
C++ vector decimal to binary
C++