STL容器类,基础数据结构的实现(栈,队列,双端队列,链表和优先级队列等)
Problem ID | Title | 分类 | AC | Submit | 正确率 | |
Problem A | 删除重复 | STL | 176 | 267 | ||
Problem B | 单词统计问题 | STL字符串 | 175 | 340 | ||
Problem C | 出圈 | 模拟STL | 171 | 306 | ||
Problem D | 括号匹配 | 数据结构栈 | 175 | 255 | ||
Problem E | 逆波兰式求值 | 字符串数据结构 | 169 | 244 | ||
Problem F | 波兰式求值 | 数学栈递归 | 166 | 404 | ||
Problem G | 解密QQ号 | 队列数据结构 | 168 | 251 | ||
Problem H | 解密QQ号II | 数据结构模拟STL | 163 | 279 | ||
Problem I | 输出二叉树 | 递归树 | 173 | 275 | ||
Problem J | Dynamic Arrays and List - Vector | STL | 164 | 261 | ||
Problem K | Dynamic Arrays and List - Deque | STL队列双端队列 | 163 | 294 | ||
Problem L | Dynamic Arrays and List - List | STL | 154 | 455 | ||
Problem M | Basic Data Structures - Stack | STL | 162 | 217 | ||
Problem N | Basic Data Structures - Queue | STL | 144 | 354 | ||
Problem O | Basic Data Structures - Priority Queue | STL | 158 | 252 | ||
Problem P | 懒省事的小明 | 堆优先级队列 | 147 | 304 |