测试评估
| 指标 | 结果 |
|---|---|
| Base 测试 | PASS |
| Plus 测试 | PASS |
| 代码长度 | 568 字符 |
模型生成的代码 （568 字符）
import heapq
def larg_nnum(lst, n):
"""
Returns a list containing the n largest items from the given list.
Parameters:
lst (list): The input list of numbers.
n (int): The number of largest items to return.
Returns:
list: A list of the n largest items.
"""
if n >= len(lst):
return lst[:] # Return a copy of the entire list if n exceeds length
# Using heapq.nlargest for O(n log n) performance, which is efficient.
# Alternatively, sorted(lst, reverse=True)[:n] works too.
return heapq.nlargest(n, lst)Base 失败测试用例
- 无失败测试
Plus 失败测试用例
- 无失败测试