测试评估
| 指标 | 结果 |
|---|---|
| Base 测试 | PASS |
| Plus 测试 | FAIL |
| 代码长度 | 522 字符 |
模型生成的代码 （522 字符）
def max_sub_array_sum(arr, n):
"""
Returns the sum of the largest contiguous sublist (maximum subarray sum).
Parameters:
arr (list): List of integers.
n (int): Length of the list.
Returns:
int: Maximum sum of any contiguous sublist.
"""
# Kadane's algorithm
max_ending_here = arr[0]
max_so_far = arr[0]
for i in range(1, n):
max_ending_here = max(arr[i], max_ending_here + arr[i])
max_so_far = max(max_so_far, max_ending_here)
return max_so_farBase 失败测试用例
- 无失败测试
Plus 失败测试用例
[[], 0]