算法--最大連續子序列和（動態規劃，分而治之）

今天在LeetCode上遇到一個求最大連續子序列和的問題，以下： Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.javascript Example: Input: [-2,

>>阅读原文<<