实验目的
仅仅认识到栈和队列是两种特殊的线性表是远远不够的,本次实验的目的在于使学生深入了解栈和队列的特征,以便在实际问题背景下灵活运用它们;同时还将巩固这两种结构的构造方法,接触较复杂问题的递归算法设计。
实验要求
1) 编程实现必做实验内容 1267, 1268。
2) 学生可根据自己的能力选做实验内容 1269。
3) 填写实验报告(见教学云)。
RunID | User | Nick Name | Problem ID | Result | Memory | Time | Language | Code Length | Submit Time |
172621 | 2022211431 | 凡尘天 | Accepted | 2176KB | 2ms | C++ | 397 bytes | 2023-10-17 15:33:48 | |
172620 | 2022211431 | 凡尘天 | Time Limit Exceed | 2176KB | 1880ms | C++ | 398 bytes | 2023-10-17 15:33:32 | |
172619 | 2022211431 | 凡尘天 | Accepted | 6276KB | 6ms | C++ | 336 bytes | 2023-10-17 15:32:32 | |
172616 | 2022211431 | 凡尘天 | Time Limit Exceed | 2176KB | 1879ms | C++ | 371 bytes | 2023-10-17 15:25:40 | |
172615 | 2022211431 | 凡尘天 | Accepted | 2512KB | 3ms | C++ | 1610 bytes | 2023-10-17 15:24:41 | |
172614 | 2022211431 | 凡尘天 | Accepted | 2512KB | 2ms | C++ | 1644 bytes | 2023-10-17 15:24:03 | |
172613 | 2022211431 | 凡尘天 | Output Limit Exceed | 2512KB | 3ms | C++ | 1650 bytes | 2023-10-17 15:22:51 | |
172610 | 2022211431 | 凡尘天 | Output Limit Exceed | 2512KB | 3ms | C++ | 1636 bytes | 2023-10-17 15:20:02 | |
172605 | 2022211431 | 凡尘天 | Output Limit Exceed | 2440KB | 3ms | C++ | 1676 bytes | 2023-10-17 15:12:24 | |
172602 | 2022211431 | 凡尘天 | Output Limit Exceed | 2440KB | 3ms | C++ | 1666 bytes | 2023-10-17 15:11:17 | |
172600 | 2022211431 | 凡尘天 | Output Limit Exceed | 2440KB | 2ms | C++ | 1640 bytes | 2023-10-17 15:09:57 | |
172599 | 2022211431 | 凡尘天 | Output Limit Exceed | 2440KB | 2ms | C++ | 1640 bytes | 2023-10-17 15:08:21 | |
172582 | 2022211431 | 凡尘天 | Wrong Answer | 2440KB | 2ms | C++ | 1677 bytes | 2023-10-17 14:56:04 | |
172581 | 2022211431 | 凡尘天 | Time Limit Exceed | 2176KB | 1880ms | C++ | 354 bytes | 2023-10-17 14:55:46 | |
171862 | 2022211431 | 凡尘天 | Wrong Answer | 2176KB | 2ms | C++ | 292 bytes | 2023-10-16 17:57:53 | |
171859 | 2022211431 | 凡尘天 | Wrong Answer | 2176KB | 2ms | C++ | 280 bytes | 2023-10-16 17:54:47 |