LeetCode(53):Maximum Subarray

Maximum Subarray: Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [−2,1,−3,4,−1,2,1,−5,4],the contiguous subarray [4,−1,2,1] has the largest sum = 6.

题意：找出给定数组中子数组之和的最大值，子数组中元素是连续的。

思路：采用动态规划的方法。

代码：

public class Solution {public int maxSubArray(int[] nums) {int max = nums[0];int[] sum = new int[nums.length];sum[0] = nums[0];for(int i=1;i<nums.length;i++){sum[i] = Math.max(nums[i],sum[i-1]+nums[i]);max = Math.max(max,sum[i]);}return max;}
}

转载于:https://www.cnblogs.com/Lewisr/p/5200927.html

LeetCode(53):Maximum Subarray相关推荐

【DP】LeetCode 53. Maximum Subarray
LeetCode 53. Maximum Subarray Solution1:我的答案动态规划 class Solution { public:int maxSubArray(vector< ...
【动态规划】LeetCode 53. Maximum Subarray
LeetCode 53. Maximum Subarray 原题描述(求子序列最大和/最大子串):Find the contiguous subarray within an array (conta ...
[Lintcode]41. Maximum Subarray/[Leetcode]53. Maximum Subarray
41. Maximum Subarray/53. Maximum Subarray 本题难度: Eas Topic: Dynamic Programming Description Given an ...
[LeetCode]: 53: Maximum Subarray
题目: Find the contiguous subarray within an array (containing at least one number) which has the larg ...
leetCode 53. maximum subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
LeetCode#53 Maximum Subarray
Problem Difinition: Find the contiguous subarray within an array (containing at least one number) wh ...
C#解leetcode 53.Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
53.Maximum Subarray
/** 53.Maximum Subarray * 2016-5-7 by Mingyang * 如果我们从头遍历这个数组.对于数组中的其中一个元素,它只有两个选择: 1.* 要么加入之前的数组加和之 ...
LeetCode 53. Maximum Subarray--动态规划--C++,Python解法
题目地址:Maximum Subarray - LeetCode Given an integer array nums, find the contiguous subarray (containi ...

LeetCode(53):Maximum Subarray

LeetCode(53):Maximum Subarray相关推荐

最新文章

热门文章