week17-leetcode #53-Maximum Subarray

week17-leetcode #53-Maximum Subarray

链接：https://leetcode.com/problems/maximum-subarray/description/

Question

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [-2,1,-3,4,-1,2,1,-5,4],
the contiguous subarray [4,-1,2,1] has the largest sum = 6.

Solution

class Solution {
public:
  // local[i]表示以i结尾的最大子数组和(这样定义是为了方便运算)
  // global[i]表示到i为止的最大子数组和
  int maxSubArray(vector<int>& nums) {
    int size = nums.size();
    int* local = new int[size];
    int* global = new int[size];
    local[0] = nums[0];
    global[0] = nums[0];
    for (int i = 1; i < size; i++) {
      local[i] = max(nums[i], local[i-1]+nums[i]);
      global[i] = max(global[i-1], local[i]);
    }
    return global[size-1];
  }
};

思路：动态规划的方法，维护两个数组，分别是$local​$和$global​$。其中，$local[i]​$表示以第$i​$个数字结尾的最大的子数组和，而$global[i]​$表示到$i​$为止的最大子数组和。显然$local[i]​$默认已经包含第$i​$个数组元素，只需要决定要不要加上$local[i-1]​$（也就是以第$i-1​$个元素结尾的最大子数组和）