动态规划法求最大字段和时间复杂度_剑指offer_go_面试题42

题目

输入一个整型数组，数组里有正数也有负数。数组中的一个或连续多个整数组成一个子数组。求所有子数组的和的最大值。

要求时间复杂度为O(n)。

示例1:输入: nums = [-2,1,-3,4,-1,2,1,-5,4]输出: 6

解释: 连续子数组 [4,-1,2,1] 的和最大，为 6。

提示：

1 <= arr.length <= 10^5

-100 <= arr[i] <= 100

注意：本题与主站 53 题相同

解题思路分析

1、贪心法；时间复杂度O(n)，空间复杂度O(1)

func maxSubArray(nums []int) int {result := nums[0]sum := 0for i := 0; i < len(nums); i++ {if sum > 0 {sum += nums[i]} else {sum = nums[i]}if sum > result {result = sum}}return result}

2、动态规划；时间复杂度O(n)，空间复杂度O(n)

func maxSubArray(nums []int) int {dp := make([]int, len(nums))dp[0] = nums[0]result := nums[0]for i := 1; i < len(nums); i++ {if dp[i-1]+nums[i] > nums[i] {dp[i] = dp[i-1] + nums[i]} else {dp[i] = nums[i]}if dp[i] > result {result = dp[i]}}return result}

3、动态规划；时间复杂度O(n)，空间复杂度O(1)

func maxSubArray(nums []int) int {dp := nums[0]result := dpfor i := 1; i < len(nums); i++ {if dp+nums[i] > nums[i] {dp = dp + nums[i]} else {dp = nums[i]}if dp > result {result = dp}}return result}

4、分治；时间复杂度O(nlog(n))，空间复杂度O(log(n))

func maxSubArray(nums []int) int {result := maxSubArr(nums, 0, len(nums)-1)return result}func maxSubArr(nums []int, left, right int) int {if left == right {return nums[left]}mid := (left + right) / 2leftSum := maxSubArr(nums, left, mid)        // 最大子序在左边rightSum := maxSubArr(nums, mid+1, right)    // 最大子序在右边midSum := findMaxArr(nums, left, mid, right) // 跨中心result := max(leftSum, rightSum)result = max(result, midSum)return result}func findMaxArr(nums []int, left, mid, right int) int {leftSum := math.MinInt32sum := 0// 从右到左for i := mid; i >= left; i-- {sum += nums[i]leftSum = max(leftSum, sum)}rightSum := math.MinInt32sum = 0// 从左到右for i := mid + 1; i <= right; i++ {sum += nums[i]rightSum = max(rightSum, sum)}return leftSum + rightSum}func max(a, b int) int {if a > b {return a}return b}