leetcode 53. Maximum Subarray(DP动态规划问题)

问题描述：

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.

思路：

本题为最优解问题，可利用动态规划思路求解。从头到尾遍历每一个数组元素，如何前面元素的和为正，则加上本元素的值继续搜索；如何前面元素的和为负，则此元素开始新的和计数。整个过程中要注意更新和的最大值。

代码：

class Solution {public int maxSubArray(int[] nums) {if(nums == null) return 0;int sum = 0;int max = Integer.MIN_VALUE;for(int i = 0 ; i < nums.length; i++){if(sum + nums[i] > nums[i])sum += nums[i];elsesum = nums[i];if(sum > max)max = sum;}return max;       }
}

leetcode 53. Maximum Subarray(DP动态规划问题)相关推荐

【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
Maximum Subarray: Find the contiguous subarray within an array (containing at least one number) whic ...
leetCode 53. maximum subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
[LeetCode]: 53: Maximum Subarray
题目: Find the contiguous subarray within an array (containing at least one number) which has the larg ...
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(DP动态规划问题)

leetcode 53. Maximum Subarray(DP动态规划问题)相关推荐

最新文章

热门文章