这是《数据结构题集》的部分题目算法的文件夹

This is a folder for the problems which are parts of my DataStructrue ExerciseBook

注:方括号里的数字表示难度，越大越难

NOTE:Number in brackets represents the level of the problem,the bigger the harder

题目如下:

2.11 [2]

将元素插入到非递减顺序表中，且不破坏其顺序

Insert data into an increment Sequence List without breaking its order

2.12 [3]

比较两个顺序表(A,B)的大小

Compare 2 sqlists(A,B)

2.19 [3]

删除非递减有序的链表中，大于minv小于maxv区间里的元素

Remove a interval between minv and maxv from a increment sllist

2.24 [4]

将两个非递减有序的链表sll1和sll2合并为一个非递增有序的链表sll3, 并且用原来sll1和sll2的空间来构造sll3

Combine 2 link-lists sll1 and sll2, which are non-decreasing, to a non-increasing sll3 by using the space of sll1 and sll2

2.29 [5]

从顺序表A中删除所有同时也存在于顺序表B和顺序表C中的元素

Remove all of the elements which are also present in sqlist B and sqlist C from sqlist A

3.19 [4]

括号匹配：()、[]和{}

Brackets Matching : () , [] and {}

3.21 [3]

中缀表达式转逆波兰表达式

Transform an expression from nifix form to reverse polish form

3.28 [2]

实现只有尾指针的循环链队列的初始化、入队列和出队列

Implement the Initialization, Enqueue, Dequeue of a link-list-based round-robin queue