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