LeetCode 53. Maximum Subarray [Swift 题解]

题目

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  
Explanation: [4,-1,2,1] has the largest sum = 6.  

Follow up:

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

思路

  1. brute force
  2. divide and conquer
  3. dynamic programming
  4. in place
class Solution {  
    func maxSubArray(_ nums: [Int]) -> Int {
        var copy = nums
        for i in 1..<nums.count {
            copy[i] = max(copy[i],  copy[i] + copy[i - 1])
        }

        return copy.max()!
    }
}

chenbo

编程爱好者

Singapore