find maximum subarray sum code example
Example 1: find longest subarray by sum
def max_length(s, k):
current = []
max_len = -1
for i in s:
current.append(i)
while sum(current) > k:
current = current[1:]
if sum(current) == k:
max_len = max(max_len, len(current))
return max_len
Example 2: max subsequence sum in array
def max_subarray(numbers):
"""Find the largest sum of any contiguous subarray."""
best_sum = 0
current_sum = 0
for x in numbers:
current_sum = max(0, current_sum + x)
best_sum = max(best_sum, current_sum)
return best_sum