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

2 votes127 views1 answer
C++ flush stdin
C++
30 votes86 views10 answers
While loop c++
C++
1 vote119 views1 answer
Const char to string
C++
0 vote152 views1 answer
Std::random_device
C++
6 votes155 views2 answers
Find permutations
C++
0 vote154 views1 answer
How to format decimal palces in c++
C++
0 vote118 views1 answer
A variable with 2 independant variables plot
C++
2 votes123 views2 answers
Qt qstring to float
C++
15 votes126 views10 answers
Hello world
C++
1 vote160 views2 answers
How to print numbers with only 2 digits after decimal point in c++
C++