leetcode刷題53.maximum-sum-subarray-cn

來源：https://leetcode.com/problems/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
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

 

	local function maxSubArray(arr)
		local currMaxSum = arr[1];
		local maxSum = arr[1];
		for i=2,#arr do
			currMaxSum = math.max(currMaxSum + arr[i], arr[i]);
			maxSum = math.max(maxSum, currMaxSum);
		end
		return maxSum;
	end

	local nums = {-2,1,-3,4,-1,2,1,-5,4};
	local maxSum = maxSubArray(nums)
	print("maxSum="..maxSum)