[Lintcode]41. Maximum Subarray/[Leetcode]53. Maximum Subarray
41. Maximum Subarray/53. Maximum Subarray
- 本题难度: Eas
- Topic: Dynamic Programming
Description
Given an array of integers, find a contiguous subarray which has the largest sum.
Example
Example1:
Given the array [−2,2,−3,4,−1,2,1,−5,3], the contiguous subarray [4,−1,2,1] has the largest sum = 6.
Example2:
Given the array [1,2,3,4], the contiguous subarray [1,2,3,4] has the largest sum = 10.
Challenge
Can you do it in time complexity O(n)?
Notice
The subarray should contain at least one number.
我的代码
class Solution:def maxSubArray(self, nums):""":type nums: List[int]:rtype: int"""#Oct 10, 2018l = len(nums)if l == 0:return 0if l == 1:return nums[0]top = nums[0]tmp = topfor i in range(1,l):if top<0 and nums[i]>top:top = nums[i]tmp = topcontinueif nums[i]+tmp>0:tmp = tmp + nums[i]if tmp>top:top = tmpelse:tmp = 0return top别人的代码
for i in range(1, len(nums)):if nums[i-1] > 0:nums[i] += nums[i-1]return max(nums)
思路
那个别人的代码真个天才我的天哦
转载于:https://www.cnblogs.com/siriusli/p/10388349.html
[Lintcode]41. Maximum Subarray/[Leetcode]53. Maximum Subarray相关推荐
- 【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 ...
- LeetCode(53):Maximum Subarray
Maximum Subarray: Find the contiguous subarray within an array (containing at least one number) whic ...
- LeetCode 53. Maximum Subarray--动态规划--C++,Python解法
题目地址:Maximum Subarray - LeetCode Given an integer array nums, find the contiguous subarray (containi ...
- [LeetCode]: 53: Maximum Subarray
题目: Find the contiguous subarray within an array (containing at least one number) which has the larg ...
- leetCode 53. maximum subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
- 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 ...
- Leetcode 53. Maximum SubarrayJAVA语言
1 2 3 Find the contiguous subarray within an array (containing at least one number) which has the la ...
最新文章
- 今天，我辞去了亚马逊年薪 50 万美金的工作！
- 系统重构的10点经验总结
- Mybatis核心配置文件SqlMapConfig.xml独立使用配置内容
- mysql insert 运算_MySql insert插入操作的3个小技巧分享
- Java使用Cipher类实现加密，包括DES，DES3，AES和RSA加密
- Spring知识点总结
- 【算法】算法之会议安排问题（C++源码）
- oracle校验统一社会信用代码函数
- 把一个godaddy的域名转回国内的注册商
- 【数据库架构】NewSQL和PGXC
- Android/安卓 文本添加中划线、下划线的方法
- 什么是php 开发,php开发是什么？
- 微信开发 现金红包、裂变红包、企业付款
- nyoj 一笔画问题
- 第19章 Linux电源管理的系统架构和驱动之CPUFreq驱动
- 关于SQL注入，绕过逗号过滤
- C# 原子操作 Interlocked
- ck3m多轴运动控制器笔记1：电机的配置与注意事项
- 2022-2028年中国高速铁路行业投资分析及前景预测报告
- stm32指纹、蓝牙识别门禁系统项目详解