[LintCode] Maximum Subarray 最大子数组

Given an array of integers, find a contiguous subarray which has the largest sum.

Notice

The subarray should contain at least one number.

Have you met this question in a real interview?

Yes

Example

Given the array [−2,2,−3,4,−1,2,1,−5,3], the contiguous subarray [4,−1,2,1] has the largest sum = 6.

Challenge

Can you do it in time complexity O(n)?

LeetCode上的原题，请参见我之前的博客Maximum Subarray。

解法一：

class Solution {
public:    /*** @param nums: A list of integers* @return: A integer indicate the sum of max subarray*/int maxSubArray(vector<int> nums) {int res = INT_MIN, curSum = 0;for (int num : nums) {curSum += num;curSum = max(curSum, num);res = max(res, curSum);}return res;}
};

解法二：

class Solution {
public:    /*** @param nums: A list of integers* @return: A integer indicate the sum of max subarray*/int maxSubArray(vector<int> nums) {if (nums.empty()) return 0;return helper(nums, 0, (int)nums.size() - 1);}int helper(vector<int>& nums, int left, int right) {if (left >= right) return nums[left];int mid = left + (right - left) / 2;int lmax = helper(nums, left, mid - 1);int rmax = helper(nums, mid + 1, right);int mmax = nums[mid], t = mmax;for (int i = mid - 1; i >= left; --i) {t += nums[i];mmax = max(mmax, t);}t = mmax;for (int i = mid + 1; i <= right; ++i) {t += nums[i];mmax = max(mmax, t);}return max(mmax, max(lmax, rmax));}
};

[LintCode] Maximum Subarray 最大子数组相关推荐

[LeetCode] Maximum Subarray 最大子数组
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
LeetCode Maximum Product Subarray(最大子数组乘积)
Find the contiguous subarray within an array (containing at least one number) which has the large ...
LintCode Python 简单级题目 41.最大子数组 - 44.最小子数组和
题目1 最小子数组描述: 给定一个整数数组,找到一个具有最小和的子数组.返回其最小和. 注意事项子数组最少包含一个数字您在真实的面试中是否遇到过这个题? Yes 样例给出数组[1, -1, - ...
[Lintcode]41. Maximum Subarray/[Leetcode]53. Maximum Subarray
41. Maximum Subarray/53. Maximum Subarray 本题难度: Eas Topic: Dynamic Programming Description Given an ...
lintcode 最大子数组III
题目描述给定一个整数数组和一个整数 k,找出 k 个不重叠子数组使得它们的和最大.每个子数组的数字在数组中的位置应该是连续的. 返回最大的和. 注意事项子数组最少包含一个数样例给出数组 [-1 ...
Lintcode42 Maximum Subarray II solution 题解
[题目描述] Given an array of integers, find two non-overlapping subarrays which have the largest sum.The ...
[经典面试题][淘宝]求首尾相连数组的最大子数组和
题目给定一个由N个整数元素组成的数组arr,数组中有正数也有负数,这个数组不是一般的数组,其首尾是相连的.数组中一个或多个连续元素可以组成一个子数组,其中存在这样的子数组arr[i],-arr[n- ...
Leetcode52.Maximum Subarray(贪心与分治)
题目描述: Given an integer array nums, find the contiguous subarray (containing at least one number) whi ...
LeetCode Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest ...

[LintCode] Maximum Subarray 最大子数组

Notice

[LintCode] Maximum Subarray 最大子数组相关推荐

最新文章

热门文章