LeetCode-53-Maximum Subarray(最大和子串)
2017-08-01 09:53
369 查看
Q:
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.
Analysis:
题目较容易理解,求数组中最大和子串,返回和。
比较好想到用动态规划,dp[i]=max{sum[i],sum[i]+num[i+1]}
Code:
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.
Analysis:
题目较容易理解,求数组中最大和子串,返回和。
比较好想到用动态规划,dp[i]=max{sum[i],sum[i]+num[i+1]}
Code:
public class Solution { public int maxSubArray(int[] nums) { if(nums.length==0||nums==null){ return 0; } int max=nums[0]; int sum=nums[0]; for(int i=1;i<nums.length;i++){ sum=Math.max(nums[i], nums[i]+sum); max=Math.max(max,sum); } return max; } }
相关文章推荐
- Leetcode 53 Maximum Subarray 最大子串和
- Scala Maximum Subarray 最大子串 leetcode 53
- LeetCode 53 分治算法,求最大子串
- LeetCode问题53:最大的连续子数组和
- LeetCode | 673. Number of Longest Increasing Subsequence中等偏难题 找寻数组里面最大长度的子串的个数
- 【LeetCode】寻找最大长度不重复子串
- [Leetcode-53]Maximum Subarray 最大子数组和
- 【Leetcode】寻找数串中连续最大整数和且最大长度的子串
- 【Leetcode】寻找数串中连续最大整数和且最大长度的子串
- [leetcode 53] Maximum Subarray----最大子数组的和
- Leetcode 3 - 最大不重复子串
- LeetCode53最大子序和
- LeetCode 5 最大回文子串
- leetcode笔记:Maximum Subarray(最大子串和问题)
- LeetCode 53 Maximum Subarray 最大子序列和
- leetcode-java.T005_LongestPalindromicSubstringTotal 给定一个字符串S,找出它的最大的回文子串
- [leetcode]53. Maximum Subarray 最大连续子串python实现【medium】
- leetcode-53 Maximum Subarray 连续子数组的最大和
- LeetCode 3 最大不重复子串
- Leetcode—最大无重复子串