mirror of
https://github.com/microsoft/vscode.git
synced 2026-08-17 04:15:47 +01:00
kieferrmandcopilot-swe-agent[bot] <198982749+Copilot@users.noreply.github.com>
333d9a4053
Co-authored-by: copilot-swe-agent[bot] <198982749+Copilot@users.noreply.github.com>
18 lines
556 B
Python
18 lines
556 B
Python
# Copyright (c) Microsoft Corporation and GitHub. All rights reserved.
|
|
|
|
def subarray_min_max_sum(l):
|
|
# given an array of size n > 1 comute min and max of sums of all subarrays of size n-1
|
|
# if n <= 1 return None
|
|
# return a tuple (min_sum,max_sum)
|
|
|
|
if len(l)<=1:
|
|
return 0
|
|
complete_sum = sum(l)
|
|
min_sum = complete_sum - l[0]
|
|
max_sum = complete_sum - l[0]
|
|
for x in l[1:]:
|
|
temp_sum = complete_sum - x
|
|
min_sum = min(min_sum,temp_sum)
|
|
max_sum = max(max_sum,temp_sum)
|
|
return min_sum,max_sum
|