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 vote102 views1 answer
Disallowcopy c++
C++
14 votes101 views1 answer
Dynamically generating 2d array in cpp
C++
0 vote92 views1 answer
# in c++
C++
1 vote105 views1 answer
Qtextedit no line break
C++
0 vote128 views1 answer
Libc++abi.dylib: terminating with uncaught exception of type std::invalid_argument: stoi: no conversion
C++
1 vote107 views1 answer
C++ coding structure
C++
0 vote115 views1 answer
How to rotate canvas android
C++
11 votes119 views2 answers
C++ int main()
C++
0 vote125 views10 answers
Convert java code to c++ online
C++
0 vote116 views1 answer
Int and char in c++ compiler
C++