leetcode 53 Maximum Subarray
2017-06-07 16:23
246 查看
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array
the contiguous subarray
思路：dp
dp[i]表示一a[i]结尾的最大子数组的和
dp[i]=max(dp[i-1]+a[i],a[i]);
AC代码
public class Solution {
public int maxSubArray(int[] nums) {
int n=nums.length;
int dp[]=new int
;
dp[0]=nums[0];
int answer=dp[0];
for(int i=1;i<n;i++){
dp[i]=Math.max(dp[i-1]+nums[i],nums[i]);
answer=Math.max(dp[i],answer);
}
return answer;
}
}
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.
思路：dp
dp[i]表示一a[i]结尾的最大子数组的和
dp[i]=max(dp[i-1]+a[i],a[i]);
AC代码
public class Solution {
public int maxSubArray(int[] nums) {
int n=nums.length;
int dp[]=new int
;
dp[0]=nums[0];
int answer=dp[0];
for(int i=1;i<n;i++){
dp[i]=Math.max(dp[i-1]+nums[i],nums[i]);
answer=Math.max(dp[i],answer);
}
return answer;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode-53：Maximum Subarray （和最大的连续子数组）
- [C++]LeetCode: 53 Unique Binary Search Trees
- Leetcode 53:Maximum Subarray
- leetcode(53). Maximum Subarray
- [leetcode]53 Ugly Number
- leetcode 53: Spiral Matrix
- LeetCode 53 - Maximum Subarray
- leetcode.(53).205. Isomorphic Strings
- LeetCode 53 Recover Binary Search Tree
- LeetCode53-Maximum Subarray
- LeetCode - 53. 最大子序和
- 【LeetCode 53】 Maximum Subarray
- leetcode-53
- 【LEETCODE】53-Maximum Subarray
- leetcode-53-Maximum Subarray 动态规划
- [LeetCode]53. Happy Number快乐数
- [leetcode53]两种思路解决的Maximun Subarray
- 【leetcode】【53】Maximum Subarray
- [LeetCode]53 Maximum Subarray
- leetcode53~Maximum Subarray