leetcode:Maximum Subarray---python
来源:互联网 发布:淘宝非法交易如何退货 编辑:程序博客网 时间:2024/05/22 02:07
题目描述:
Maximum Subarray
Total Accepted: 19365 Total Submissions: 58198My SubmissionsFind 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.
class Solution:
# @param A, a list of integers
# @return an integer
def maxSubArray(self, A):
result = min(A);
now = 0;
for i in range(0, len(A)):
now = max(now, 0);
now = now + A[i];
result = max(now, result);
return max(result,now);
0 0
- leetcode:Maximum Subarray---python
- Maximum Subarray Leetcode Python
- Leetcode-Maximum Subarray-Python
- 【Leetcode】【python】Maximum Subarray
- 【LeetCode with Python】 Maximum Subarray
- Maximum Prodyct Subarray Leetcode Python
- [leetcode:python]53.Maximum Subarray
- [Leetcode]152. Maximum Product Subarray @python
- 【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
- UVA 575-Skew Binary
- LeetCode 024. Swap Nodes in Pairs
- hdu1114Piggy-Bank
- 打印二叉树中所有和为某一值的路径
- 二叉树的递归定义及存储
- leetcode:Maximum Subarray---python
- ASP.NET的内置对象:Session对象
- C#:静态与非静态
- Unity添加GIF动画
- POJ 3411 BFS+状压
- Android SDK Manager 无法下载更新,或者更新速度超慢,或者待安装包列表不显示。
- 每个程序员都应牢记的7种坏味道,11种原则,23种模式
- cenos oracle11g 安装
- storage class specified for parameter