53. Maximum Subarray

53. Maximum Subarray

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example:

Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.

 

 class Solution {
 public:
     int maxSubArray(vector<int>& nums) {
         int currentSum, maxrlt;
         currentSum = maxrlt = nums[0];
         int cnt = nums.size();
         for(int i=1; i<cnt; i++) {
             currentSum = max(nums[i], nums[i]+currentSum);
             maxrlt = max(maxrlt, currentSum);
         }
         return maxrlt;
     }
 };