队列
文章平均质量分 89
memcpy0
希望探索文理结合的自由之路。
展开
-
LeetCode 2810. Faulty Keyboard【模拟,双端队列,字符串】简单
你的笔记本键盘存在故障,每当你在上面输入字符 时,它会反转你所写的字符串。而输入其他字符则可以正常工作。给你一个下标从 0 开始的字符串 ,请你用故障键盘依次输入每个字符。返回最终笔记本屏幕上输出的字符串。示例 1:示例 2:提示:本题可以每次遇到 就反转前面的所有字符,但假如后一半的字符全部是 ,遍历到后一半时,每次都要将前一半的字符反转一遍,这样的代价是 O(n2)O(n^2)O(n2) 的。我们可以把第一次遇到 反转,看作是往字符串的头部依次添加后续字符,最后从字符串尾部往前读取全部字符原创 2023-08-12 15:47:33 · 356 阅读 · 0 评论 -
【PAT甲级】1014 Waiting in Line (30 分)
Suppose a bank has NNN windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. The rules for the customers to wait in line are:The space inside the yellow line in front of each window is eno原创 2021-05-29 05:27:44 · 333 阅读 · 0 评论 -
LeetCode C++ 1861. Rotating the Box【Queue/Two Pointers】中等
You are given an m x n matrix of characters box representing a side-view of a box. Each cell of the box is one of the following: A stone '#' A stationary obstacle '*' Empty '.'The box is rotated 90 degrees clockwise, causing some of the stones to fal原创 2021-05-18 02:37:18 · 276 阅读 · 1 评论 -
LeetCode C++ 面试题 03.06. Animal Shelter LCCI【Queue/Design】简单
enqueue method has a animal parameter, animal[0] represents the number of the animal, animal[1] represents the type of the animal, 0 for cat and 1 for dog.dequeue* method returns [animal number, animal type], if there’s no animal that can be adopted, retu原创 2020-11-17 00:32:53 · 261 阅读 · 1 评论 -
【数据结构Java实现】队列【数组队列、循环队列和链队】
文章目录一、队列Queue和基本操作二、动态数组实现顺序队列ArrayQueue三、数组队列的复杂度分析四、动态数组实现循环队列LoopArray五、循环队列的复杂度分析六、数组队列和循环队列的时间测试比较一、队列Queue和基本操作队列和生活中的队一样,FIFOFIFOFIFO,先进先出。有了实现栈的经验,实现队列就简单了:void enqueue(E)E dequeue()E g...原创 2020-03-11 12:17:37 · 333 阅读 · 0 评论 -
LeetCode C++ 232. Implement Queue using Stacks【Queue】【使用栈实现队列】
Implement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes the element from in front of queue.peek() -- Get the front element.empty(...原创 2020-02-23 14:19:39 · 188 阅读 · 0 评论 -
LeetCode C++ 225. Implement Stack using Queues 【Stack】【使用队列实现栈】
Implement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get the top element.empty() -- Return whet...原创 2020-02-23 14:19:02 · 263 阅读 · 0 评论