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 vote116 views1 answer
Ds1307 rtc set time
C++
0 vote122 views1 answer
Implementing split function in c++
C++
0 vote134 views1 answer
How to change the type of something in c++
C++
1 vote133 views1 answer
Int main() {
C++
1 vote128 views1 answer
Qtextedit no line break
C++
0 vote131 views1 answer
Cpp set time
C++
1 vote120 views2 answers
Cpp substring
C++
2 votes117 views1 answer
Unordered_map of pair and int
C++
3 votes138 views2 answers
Access last element of set c++
C++
0 vote122 views1 answer
C++ remove all elements equal to
C++