实验目的
仅仅认识到栈和队列是两种特殊的线性表是远远不够的,本次实验的目的在于使学生深入了解栈和队列的特征,以便在实际问题背景下灵活运用它们;同时还将巩固这两种结构的构造方法,接触较复杂问题的递归算法设计。
实验要求
1) 编程实现必做实验内容 1267, 1268。
2) 学生可根据自己的能力选做实验内容 1269。
3) 填写实验报告(见教学云)。
RunID | User | Nick Name | Problem ID | Result | Memory | Time | Language | Code Length | Submit Time |
174044 | 2022211453 | 王炸 | Accepted | 1192KB | 2ms | C | 3323 bytes | 2023-10-19 11:19:14 | |
172346 | 2022211453 | 王炸 | Accepted | 1192KB | 2ms | C | 1261 bytes | 2023-10-17 00:54:17 | |
172202 | 2022211453 | 王炸 | Wrong Answer | 1192KB | 2ms | C | 1256 bytes | 2023-10-16 22:32:06 | |
172195 | 2022211453 | 王炸 | Wrong Answer | 1192KB | 3ms | C | 1253 bytes | 2023-10-16 22:28:27 | |
172184 | 2022211453 | 王炸 | Time Limit Exceed | 1068KB | 1880ms | C | 101 bytes | 2023-10-16 22:22:27 | |
172149 | 2022211453 | 王炸 | Output Limit Exceed | 1192KB | 3ms | C | 1251 bytes | 2023-10-16 22:05:23 | |
172134 | 2022211453 | 王炸 | Output Limit Exceed | 1192KB | 2ms | C | 1238 bytes | 2023-10-16 22:00:52 | |
172114 | 2022211453 | 王炸 | Wrong Answer | 1192KB | 2ms | C | 1161 bytes | 2023-10-16 21:46:53 | |
172108 | 2022211453 | 王炸 | Output Limit Exceed | 1192KB | 3ms | C | 1180 bytes | 2023-10-16 21:42:10 | |
172099 | 2022211453 | 王炸 | Output Limit Exceed | 1192KB | 2ms | C | 1180 bytes | 2023-10-16 21:39:37 | |
172094 | 2022211453 | 王炸 | Output Limit Exceed | 1192KB | 2ms | C | 1175 bytes | 2023-10-16 21:35:15 | |
172071 | 2022211453 | 王炸 | Wrong Answer | 1192KB | 2ms | C | 1182 bytes | 2023-10-16 21:21:03 | |
171588 | 2022211453 | 王炸 | Wrong Answer | 2176KB | 2ms | C++ | 135 bytes | 2023-10-15 23:44:13 | |
171584 | 2022211453 | 王炸 | Accepted | 2176KB | 1ms | C++ | 179 bytes | 2023-10-15 23:41:30 | |
171582 | 2022211453 | 王炸 | Accepted | 2176KB | 2ms | C++ | 159 bytes | 2023-10-15 23:38:56 |