LeetCode -- Maximum Subarray
来源:互联网 发布:ubuntu使用方法 编辑:程序博客网 时间:2024/05/16 15:44
题目描述:
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.
在数组nums[]中找到连续子序列构成的最大和。
思路:
一道典型的DP题。
1.使用dp[i]来表示i位置所能达到的最大和
2.如果dp[i-1]+nums[i]大于nums[i],则dp[i] = dp[i-1]+nums[i];否则,dp[i] = nums[i]。
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.
在数组nums[]中找到连续子序列构成的最大和。
思路:
一道典型的DP题。
1.使用dp[i]来表示i位置所能达到的最大和
2.如果dp[i-1]+nums[i]大于nums[i],则dp[i] = dp[i-1]+nums[i];否则,dp[i] = nums[i]。
实现代码:
public class Solution { public int MaxSubArray(int[] nums) { if(nums.Length == 0){ return 0; } var dp = new int[nums.Length]; dp[0] = nums[0]; for(var i = 1;i < nums.Length; i++){ if(dp[i-1] + nums[i] > nums[i]){ dp[i] = dp[i-1] + nums[i]; } else{ dp[i] = nums[i]; } } return dp.Max(); }}
0 0
- 【LeetCode】Maximum Subarray 和 Maximum Product Subarray
- LeetCode: Maximum Subarray
- LeetCode Maximum Subarray
- [Leetcode] Maximum Subarray
- LeetCode: Maximum Subarray
- leetcode 25: Maximum Subarray
- [LeetCode] Maximum Subarray
- [Leetcode] Maximum Subarray
- [LeetCode]Maximum Subarray
- [leetcode]Maximum Subarray
- LeetCode-Maximum Subarray
- [leetcode] Maximum Subarray
- LeetCode 45: Maximum Subarray
- LeetCode - Maximum Subarray
- LeetCode:Maximum Subarray
- LeetCode 53: Maximum Subarray
- 【leetcode】Maximum Subarray
- Leetcode Maximum Subarray
- TensorFlow跟踪
- 逐行快速读入
- Bootstrap表单介绍
- java 中的异常
- Heap与stack的差别
- LeetCode -- Maximum Subarray
- Oracle VM VirtualBox网络说明
- 反转单链表
- HDU-新生赛-油菜花王国【并查集】
- 链表
- iframe对文档加载的影响
- 用户友好界面
- 【排序相关】选择排序、插入排序、冒泡排序
- C#和JAVA实现图片和BASE64互转