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

29 votes238 views6 answers
String to int in c++
C++
0 vote247 views1 answer
C++ classes
C++
0 vote244 views1 answer
Spicoli
C++
1 vote265 views1 answer
HOW TO TURN LINK TO BUTTON IN MVC
C++
2 votes253 views1 answer
How to speed up cin and cout
C++
0 vote277 views2 answers
C++ programming code to remove all characters from string except alphabets
C++
4 votes279 views2 answers
Jupyter lab use conda environment
C++
1 vote263 views2 answers
How to find the size of a character array in c++
C++
0 vote255 views1 answer
C++ descending sort
C++
1 vote281 views3 answers
How to take space separated input in c++
C++