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 vote167 views1 answer
How to know datatype of something in c++
C++
2 votes149 views2 answers
Palindrome checker in c++
C++
-5 votes163 views1 answer
Convert char or string to int or double
C++
2 votes140 views1 answer
Hwo to calculate the number of digits using log in c++
C++
1 vote143 views1 answer
C++ inline in .cpp and not in header
C++
0 vote139 views1 answer
Recherche recursive le max dans une liste
C++
3 votes147 views1 answer
Create a dictionary cpp
C++
0 vote155 views1 answer
What is blob in computer vision
C++
0 vote156 views2 answers
Tu hi hai aashiqui song lyrics
C++
-1 vote134 views1 answer
Cod Cold War no recoil
C++