Maximum Subarray
来源:互联网 发布:fpga 单片机 工资 编辑:程序博客网 时间:2024/06/14 02:41
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
.
click to show more practice.
More practice:
解题思路:刚开始看动态规划相关的题目。也是查看了别人的答案,才大致明白动态规划的解题思路。
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
先直接上代码吧
class Solution {public: int maxSubArray(vector<int>& nums) { int global=nums[0]; int local=nums[0];for(int i=1;i<nums.size();i++){ local=max(nums[i],local+nums[i]);global=max(local,global);}return global; }};
解题思路:刚开始看动态规划相关的题目。也是查看了别人的答案,才大致明白动态规划的解题思路。
每一步,确定一个局部最优解,一个全局最优解。全局最优解相对来说比较好表示:global[i+1]=max(local[i+1],global[i])。局部最优解,是可能存在的解。local[i+1]的表示相对来说比较麻烦一点,local[i+1]=max(local[i]+nums[i],nums[i])。
阅读全文
0 0
- maximum subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Oracle JDBC 模糊查询预编译
- Spring Boot 不使用默认的 parent,改用自己的项目的 parent
- UIAutomator2.0详解(UIDevice篇---- 序)
- SmartGit 授权文件
- STM32 的gpio mode set 详解
- Maximum Subarray
- ES6这些就够了
- Spring/Boot/Cloud系列知识(7)——Spring Aspectj EL(3)
- opencv中Mat与IplImage,CVMat类型之间转换
- QAxWidget常用接口
- cnpm 安装报错
- 实现IDEA热部署
- Android:Socket使用攻略
- 160个练手CrackMe-015