新需求: 尝试使用尽量少的数据结构来实现题目

[Certseeds]

As we all know, 有些课程的题目中会出现还没有学习的内容, 我们是否可以通过要求agent只使用有限的数据结构, 来评估题目的难度?(以及评估llm的智能)

For example:

1. in lab-welcome, you can use raw array, std::vector(ArrayList), std::set, std::map, std::unordered_map, if-else, recursion, simple function, all math result/skill and of course, input, cal, outptu three steps, and do not know how to find the complexity of algorithm, solve the problem via intuition
2. in lab-2, you know for input size, you should select a n^2 or nlogn algorithm, and binary search.
3. in lab-3, you can use std::sort!
4. in lab-4, you can write a linkedlist(and linknode) in cpp, and using std::list, LinkedList, and linkedlist algorithms, like double pointer
5. in lab-5, you can use two more struct! Queue, Stack, Deque and their algorithm

and so on...

target: 2022fall problems

[Certseeds]

从另外一个角度来讲, 除了基本数据结构之外, 将使用到的技巧总结出来, 也能用来评估题目难度.