答案:
def max_sum_of_k_consecutive(arr, k): max_sum = 0 curr_sum = 0 for i in range(len(arr) - k + 1): curr_sum = 0 for j in range(i, i + k): curr_sum += arr[j] max_sum = max(max_sum, curr_sum) return max_sum
答案:
def max_sum_of_k_consecutive(arr, k): max_sum = 0 curr_sum = 0 for i in range(len(arr) - k + 1): curr_sum = 0 for j in range(i, i + k): curr_sum += arr[j] max_sum = max(max_sum, curr_sum) return max_sum