测试评估
| 指标 | 结果 |
|---|---|
| Base 测试 | PASS |
| Plus 测试 | PASS |
| 代码长度 | 630 字符 |
模型生成的代码 （630 字符）
def is_sublist(main_list, sublist):
"""
Check if `sublist` appears as a contiguous subsequence inside `main_list`.
Parameters:
main_list (list): The list to search in.
sublist (list): The contiguous sequence to search for.
Returns:
bool: True if `sublist` is found, False otherwise.
"""
n, m = len(main_list), len(sublist)
# An empty sublist is considered to be contained in any list
if m == 0:
return True
# Slide a window of length m over main_list
for i in range(n - m + 1):
if main_list[i:i + m] == sublist:
return True
return FalseBase 失败测试用例
- 无失败测试
Plus 失败测试用例
- 无失败测试