NeWnIx

//队列的基本操作//队列只用一次动态分配内存，也就是说在一个内存单元里存储元素，所以要用到数组存储

后缀记法的实现  例：6523+8*+3+*  = ( (2+3)*8+5+3)*6 =288 没什么技术成分，新手练手。#include #include typedef struct Post{ int data; struct Post *Next; struct Post *pBottom;}*List;void init(List p){ if(p=

//栈的初始化，进栈，出栈，遍历栈，清空栈#include #include #include #include typedef struct Node{ int data; Node *next; }*pNode;typedef struct Stack{ pNode ptop; pNode pBottom;}STACK,*pStack;//-------

#include #include #include typedef struct node{ char num[20]; char name[20]; char sex[5]; char major[20]; char phone[20]; node *next;}*List;List creat(List head,node x){ if(head == NU

#include #include #include using namespace std;struct Matrix{ int a,b; Matrix(int a=0,int b=0):a(a),b(b) {}}m[26];stack s;int main(){ int n; cin>>n; for (int i=0;i<n;i++) { string

4、已有两个链表x和y，每个链表的结点包括学号和成绩，要求把两个链表合并，按学号升序排列。#include #include #include using namespace std;typedef struct list{    int num;    int score;    struct list *pNext;}*plist;

#include #include #include typedef struct node{ char num[20]; char name[20]; char sex[5]; char major[20]; char phone[20]; node *next;}*List;List insert(List head,node x){ if(head == N

http://www.cnblogs.com/heqinghui/archive/2013/07/30/3225407.html↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑优先队列讲解链接地址↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑幸福列车Time Limit: 20000/10000 MS (Java/Others)    Memory Limit:

逃生Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3592    Accepted Submission(s): 1021Problem Description糟糕的事情发生啦，现在大家都忙着逃命。但是逃命