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 Explana

>>阅读原文<<