Horje
maximum subarray leetcode c++ Code Example
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



Cpp

Related
how to setup glut main loop Code Example how to setup glut main loop Code Example
c++ write number to registry Code Example c++ write number to registry Code Example
9+20 Code Example 9+20 Code Example
ifstream file (“code2.txt”); dev C++ Code Example ifstream file (“code2.txt”); dev C++ Code Example
how to create array with not constant size in cpp Code Example how to create array with not constant size in cpp Code Example

Type:
 Code Example
Category:
 Coding
Sub Category:
 Code Example
Uploaded by:
 Admin
Views:
 10



 

Horje