队列
csu_xiji
这个作者很懒,什么都没留下…
展开
-
力扣 面试题 17.09. 第 k 个数 队列/set
https://leetcode-cn.com/problems/get-kth-magic-number-lcci/思路一:为了满足题意,对于valvalval,我们有三种扩展方式:3∗val、5∗val、7∗val3*val、5*val、7*val3∗val、5∗val、7∗val。那么自然想到用优先队列存储数据,每次取出最小的进行扩展,那么第kkk次出队的数就是答案。为了去重,我们还需要一个mapmapmap,为了防止计算过程溢出intintint,我们需要用longlonglong longlo原创 2020-08-10 20:17:20 · 398 阅读 · 0 评论 -
力扣 933. 最近的请求次数 队列
https://leetcode-cn.com/problems/number-of-recent-calls/思路:搞一个队列,每次在新的ttt值入队前,循环判断一下队首元素,把<t−3000<t-3000<t−3000的值都弹出去,然后返回队列的大小即可。class RecentCounter {public: RecentCounter(){ } int ping(int t) { int val=t-3000;原创 2020-08-10 17:40:38 · 204 阅读 · 0 评论 -
力扣 622. 设计循环队列 队列 模拟
https://leetcode-cn.com/problems/design-circular-queue/思路:和这个https://blog.csdn.net/xiji333/article/details/107916851差不多。class MyCircularQueue {public: /** Initialize your data structure here. Set the size of the queue to be k. */ MyCircularQueu原创 2020-08-10 17:12:13 · 164 阅读 · 0 评论 -
力扣 641. 设计循环双端队列 数组模拟循环双端队列
https://leetcode-cn.com/problems/design-circular-deque/思路:因为队列的容量在初始化之后就不会再改变了,所以可以用数组来模拟。front、rearfront、rearfront、rear分别代表队列的头部和尾部(rearrearrear实际上指向的队尾元素的下一个位置),初始时二者相等,为了将队列空与队列满的情况区分开来,我们需要额外花费111个元素的空间(这个空间是不放置任何元素的)。通过下标对sizesizesize取模这一操作即可实现循环位移。原创 2020-08-10 16:56:42 · 279 阅读 · 0 评论 -
力扣 面试题49. 丑数 优先队列\dp
https://leetcode-cn.com/problems/chou-shu-lcof/思路一:直接暴力做,priority_queuepriority\_queuepriority_queue取最小的数,然后把它的二倍、三倍、五倍放进去,这样第nnn次取出来的就是答案。再搞个mapmapmap去重。class Solution {public: using ll=long ...原创 2020-04-24 01:26:24 · 196 阅读 · 0 评论 -
力扣 面试题32 - III. 从上到下打印二叉树 III deque+bfs
https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/submissions/思路:bfsbfsbfs时用双端队列就行了,每次处理一层。/** * Definition for a binary tree node. * struct TreeNode { * int val...原创 2020-04-23 22:45:14 · 172 阅读 · 0 评论 -
力扣 23. 合并K个排序链表 暴力或优先队列
https://leetcode-cn.com/problems/merge-k-sorted-lists/思路一:暴力,每次取最小值加入链表中。/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x)...原创 2020-03-16 14:03:22 · 223 阅读 · 0 评论 -
POJ 2010 优先队列
http://poj.org/problem?id=2010Bessie noted that although humans have many universities they can attend, cows have none. To remedy this problem, she and her fellow cows formed a new university called...原创 2019-02-14 15:26:56 · 178 阅读 · 0 评论 -
POJ 2431 贪心+优先队列
http://poj.org/problem?id=2431A group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poor drivers, the cows unfortunately managed to run over a rock and pun...原创 2019-02-13 17:46:34 · 153 阅读 · 0 评论 -
HDU 1387 Team Queue
http://acm.hdu.edu.cn/showproblem.php?pid=1387Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occ...原创 2019-02-13 17:05:43 · 153 阅读 · 0 评论 -
洛谷 P1160 队列安排
https://www.luogu.org/problemnew/show/P1160题目描述一个学校里老师要将班上N个同学排成一列,同学被编号为1∼N,他采取如下的方法: 先将1号同学安排进队列,这时队列中只有他一个人; 2−N号同学依次入列,编号为i的同学入列方式为:老师指定编号为i的同学站在编号为1∼(i−1)中某位同学(即之前已经入列的同学)的左边或右边; ...原创 2019-02-17 18:22:18 · 413 阅读 · 0 评论