Course material release page of CS1958/CS1959 for John Class, SJTU.
Copy right: ACM Class 2018
Lab1 has been released.
Please implement a double-ended-queue, supporting fast insertion, deletion, random access, and iterator.
The API is similar to the vector implemented last semester.
Please submit your code at OJ_deque, and this site contains more information.
fast 指 deque 要求支持以不超过 O(sqrt(n))
的时间完成任意位置的插入和删除,但随机访问的复杂度要求降低为 O(sqrt(n))
.
评分模式与规则和上学期的Vector相同.
- DDL: 23:59:59 (GMT +08:00), March 27th 2022 (第六周周日)
- Code review is required.
请实现一个 map 类, 支持 快速 的插入, 查询, 修改, 删除.
需要实现接口包括
- 构造函数, 析构函数
- 重载赋值运算符
at
, 下标访问insert
erase
find
iterator
const_iterator
接口的细节请阅读代码框架中的注释.
注意:多种平衡树都可以通过全部测试, 但是非平衡树无法通过全部测试.
请在OJ_map提交你的代码.
- DDL: 23:59:59 (GTM +08:00), May 8th 2022 (第十二周周日)
- Code review is required.