测试评估
| 指标 | 结果 |
|---|---|
| Base 测试 | PASS |
| Plus 测试 | PASS |
| 代码长度 | 275 字符 |
模型生成的代码 （275 字符）
import heapq
def heap_queue_largest(nums, n):
"""
Return the n largest integers from the given list of numbers,
sorted in descending order.
"""
# heapq.nlargest returns the n largest elements, already in descending order
return heapq.nlargest(n, nums)Base 失败测试用例
- 无失败测试
Plus 失败测试用例
- 无失败测试