Problem Description

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

A subarray is a contiguous part of an array.

Examples

Example 1:

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

Example 2:

Input: nums = [1]
Output: 1

Example 3:

Input: nums = [5,4,-1,7,8]
Output: 23

Constraints:

• 1 <= nums.length <= 105
• 104 <= nums[i] <= 104

Follow up: If you have figured out the O(n) solution, try coding another solution using the divide and conquer

解析

給一個整數陣列 nums

要求寫一個演算法找出一個具有子陣列所具有得最大的合

子陣列必須每個相鄰元素都必須在原本陣列 nums 位置是連續的

定義 dp[i] = 從 0 到 i 為止是包含 nums[i] 所可能行成的最大和