Given an unsorted integer array, find the subarray that has the greatest sum. Return the sum.
Assumptions
The given array is not null and has length of at least 1.
Examples
{2, -1, 4, -2, 1}, the largest subarray sum is 2 + (-1) + 4 = 5
{-2, -1, -3}, the largest subarray sum is -1
class Solution(object):
def largestSum(self, array):
cur_sum = max_sum = array[0]
for num in array[1:]:
cur_sum = max(cur_sum + num,num)
max_sum = max(cur_sum,max_sum)
return max_sum
Given an unsorted integer array, find the subarray that h...
Subarray Sum Given an integer array, find a subarray wher...
题目描述 Maximum subarray sumThe maximum sum subarray problem...
560. Subarray Sum Equals K--Cumulative Sum Descriptions: ...
Sum of Subarray Minimums super palindrome
https://leetcode.com/problems/minimum-size-subarray-sum/ ...
Array 209. Minimum Size Subarray Sum Given an array of n ...
Array 209. Minimum Size Subarray Sum Given an array of n ...
LeetCode 209. Minimum Size Subarray Sum Description Given...
https://leetcode.com/problems/split-array-largest-sum/
本文标题：Largest SubArray Sum
本文链接：https://www.haomeiwen.com/subject/vugvjftx.html
网友评论