测试评估
| 指标 | 结果 |
|---|---|
| Base 测试 | PASS |
| Plus 测试 | PASS |
| 代码长度 | 351 字符 |
模型生成的代码 （351 字符）
import bisect
def right_insertion(a, x):
"""
Return the right insertion point for x in the sorted list a.
This is the index where x should be inserted to maintain sorted order,
placing x after any existing entries equal to x.
Example:
>>> right_insertion([1, 2, 4, 5], 6)
4
"""
return bisect.bisect_right(a, x)Base 失败测试用例
- 无失败测试
Plus 失败测试用例
- 无失败测试