2022年1月17日

[LeetCode] 232. Implement Queue using Stacks
摘要： mplement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek 阅读全文
posted @ 2022-01-17 06:56 codingEskimo 阅读(21) 评论(0) 推荐(0) 编辑
[LeetCode] 225. Implement Stack using Queues
摘要： Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (push, top, 阅读全文
posted @ 2022-01-17 06:18 codingEskimo 阅读(11) 评论(0) 推荐(0) 编辑

导航