Description: 使用循环数组方式实现双端队列，要求实现书面第二题中列出的所有操作，并实现一个Print输出操作，能将队列由左至右的次序输出于一行，元素间用空格间隔。队列元素类型设为整型。
输入：input.txt，给出一个操作序列，可能是Create、Print之外的任何操作，需要的情况下，会给出参数。最后以关键字“End”结束
-Use of an array of ways to achieve double-ended queue, a written request to achieve the second question listed in all the operation and the realization of a Print output operation, it can queue from left to right order of the output in line with spaces between elements. Queue element type is set to integer. Input: input.txt, given a sequence may be Create, Print of any operation, necessary, will be given parameters. Finally, the keyword End the end of Platform: |
Size: 263168 |
Author:yuanxu |
Hits:
Description: 循环双端队列的建立以及一些简单的操作，如插入、删除。-Cycle of double-ended queue, as well as the establishment of some simple operations such as insert, delete. Platform: |
Size: 1024 |
Author:周任红 |
Hits:
Description: 双端堆是支持双端优先队列的插入、删除最小元素和最大元素等操作的堆。
双端堆可以在对数时间内完成上述所有的操作。
-Double-ended heap to support double-ended priority queue insert, delete the smallest element and the largest such operation of the reactor element. Double-ended heap in logarithmic time to complete all of the above operation. Platform: |
Size: 2048 |
Author:liu |
Hits:
Description: 单链表类双端队列，可从两端插入
单链表类双端队列，可从两端插入-Single-chain-type double-ended queue, can be inserted from the ends of single-chain-type double-ended queue, can be inserted from both ends Platform: |
Size: 1024 |
Author:lxing |
Hits:
Description: 双端队列，简单描述了双端队列的功能，对初学者有较大帮助-Double-ended queue, a brief description of the double-ended queue functions, greater help for beginners Platform: |
Size: 2048 |
Author:高仁杰 |
Hits:
Description: C++标准库简介,包括以下内容：
1.C++标准库——函数对象
2.pair-min-max-swap
3.std_deque双端队列容器
4.std_map作为一个关联数组
5.std_set作为一个有序集合
6.容器中的型别
7.使用std_list作为链表
8.使用以vector简化对象管理
-About C++ standard library, including the following: 1.C++ standard library- the function object 2.pair-min-max-swap 3.std_deque double-ended queue container 4.std_map as an associative array 5.std_set as a ordered set 6. container type 7. Use std_list as a linked list 8. use of vector simplify object management Platform: |
Size: 59392 |
Author:陈亨利 |
Hits:
Description: 找到一个作者的关于环形队列的源码，分享一下
boost 已经有了一个这样
的缓冲区,circular_buffer，由Jan Gaspar设计实现，它的数据结构跟传统的环形队列(很多数
据结构书上有相关介绍)一样，速度比传统的环形队列快得多。只不过我对它的表现还是不
太满意，觉得它还不够快。为此，我设计了一个简单的循环双端队列，它的数据结构与
circular_buffer 没什么两样，但没有编写迭代器，也没有给出太多公有成员函数，只不过它
的速度要快一些-To find a queue of the source on the ring, to share such a boost already have a buffer, circular_buffer, designed and implemented by the Jan Gaspar, and its data structure with the traditional circular queue (a lot of data structures related presentations on the book) as , the speed is much faster than the traditional circular queue. But I am still not satisfied with its performance, that it is not fast enough. To this end, I designed a simple double-ended queue, circular, and its data structure and circular_buffer no different, but did not write iterators, nor give too much public member function, but some of its faster Platform: |
Size: 86016 |
Author:半半 |
Hits:
Description: 在一个双端队列的两端实现添加删除，并进行队列判空判满操作-In a double-ended queue, add and delete both ends to achieve, and the queue is full of sub-contracting operation of air Platform: |
Size: 268288 |
Author:张超 |
Hits:
Description: 双端队列应用于优化算法，解决竞赛题：由题目所说，Mr Pote有n个袋子装豆子。Mr Pote从中进行挑选包装，要求找出连续一列袋子，使得它们的豆子总和s在满足s p<=k条件下最大 ，以保证被狗狗吃掉的最少，并且Mr .Pote装的豆子最多。最后输出狗狗吃掉的豆子数目，即s p的结果。
抽象后表述为：给定n,p,k,以及n项数列[wi]，要求找出其一个连续子序列，使得其和s在满足s p<=k的条件下最大，输出s整除p的结果。-Double-ended queue used in optimization algorithms to solve race problems: the title says, Mr Pote has n in bags of beans. Mr Pote from which to choose packaging requirements to find continuous one bag of beans makes them the sum of s to meet the s p < = k under the condition of the maximum to the minimum guaranteed to be eaten by dogs, and Mr. Pote filled with beans up . Finally, output the number of dogs eat the beans, that s p result. After the abstract is stated as: given n, p, k, and n the number of items listed [wi], requires a continuous sequence to identify its make and s to meet their s p < = k under the conditions of maximum output s divisible p results. Platform: |
Size: 549888 |
Author:ChenSiyu |
Hits:
Description: Write a C program to implement a double ended queue ie dequeue using doubly linked list. Implement all the operations of deq-Write a C program to implement a double ended queue ie dequeue using doubly linked list. Implement all the operations of dequeue Platform: |
Size: 1024 |
Author:divyarup |
Hits:
Description: 1. 所谓双端队列（double-ended queue，deque），就是在列表的两端都可以插入和删除数据。因此它允许的操作有Create、IsEmpty、IsFull、Left、Right、AddLeft、AddRight、DeleteLeft、DeleteRight。使用循环数组方式实现双端队列，要求实现上述操作，并实现一个Print输出操作，能将队列由左至右的次序输出于一行，元素间用空格间隔。队列元素类型设为整型。-Called deque (double-ended queue, deque), at both ends of the list can insert and delete data. Therefore, it allows the operating Create, IsEmpty, IsFull, Left, Right, AddLeft, AddRight, DeleteLeft, DeleteRight. Loop array deque, required to achieve the above-mentioned operation, and achieve a Print output operation, to be able to queue output by the left-to-right order of elements in a row, separated by spaces. Queue element type to integer. Platform: |
Size: 2048 |
Author:张蕊 |
Hits:
Description: CS2208 - Data Structures Lab (Anna University)
EXERCISES
1a. Implement singly linked lists.
1b. Implement doubly linked lists.
2. Represent a polynomial as a linked list and write functions for polynomial addition.
3. Implement stack and use it to convert infix to postfix expression
4. Implement a double-ended queue (dequeue) where insertion and deletion operations are possible at both the ends.
5. Implement an expression tree. Produce its pre-order, in-order, and postorder traversals.
6. Implement binary search tree.
7. Implement insertion in AVL trees.
8. Implement priority queue using binary heaps
9. Implement hashing with open addressing.
10. Implement Prim s algorithm using priority queues to find MST of an undirected graph. Platform: |
Size: 209920 |
Author:Narayana Swamy |
Hits:
Description: 用单链表类来表示一个双端队列，要求可在表的两端插入（链表头和尾，
即可用向前和也可用向后生成），但只能在表的一端删除（链表头）。给出基于
此结构队列的两个入队和一个出队算法的成员函数。-A single linked list class to represent a double-ended queue, requirements can be inserted into the ends of the table (list head and tail can also be used with forward and backward generation), but only one end of the table delete (list head). Given queue based on this structure into two teams and a member of the team algorithm functions. Platform: |
Size: 2048 |
Author:zy |
Hits:
Search - double ended queue