int stk[10],top=0;
stk[top++]=1;
top--;
skt[top-1];
top==0;
Node *top=NULL;
auto a=new Node();
a->next=top;
top=a;
auto b=new Node();
b->next=top;
top=b;
top=top->next;
top->data;
int q[N],front=0,rear=0;
front==rear;
front=(rear+1)%N;
q[rear++]=a;
rear%N;
front=(front+1)%N;
q[front];
Node *front=new Node(),*rear=front;
rear->data=1;
rear->next=new Node();
rear=rear->next;
auto p=front();
front=front->next;
delete p;
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
typedef int ElemType;
typedef struct LNode
{
ElemType data;
struct LNode *next;
}LNode,*LinkList;
void print(LNode *L){
for(LNode *p=L;p!=NULL;p=p->next){
cout << p->data << " ";
}
cout << endl;
}
int main(){
LinkList L=new LNode;
L->next=NULL;
L->data=1;
print(L);
LinkList a=new LNode;
a->next=NULL;
a->data=2;
L->next=a;
print(L);
LinkList b=new LNode;
b->next=NULL;
b->data=3;
a->next=b;
print(L);
LinkList c=new LNode;
c->next=NULL;
c->data=4;
c->next=L->next;
L->next=c;
print(L);
c->next=c->next->next;
free(a);
print(L);
LNode *p=L;
L=L->next;
free(p);
print(L);
return 0;
}
void One(List &a,List &b,List &c){
pa=a->next;
pb=b->next;
pc=c=pa;
while(pa&&pb){
if(pa->data>pb->data){
pc->next=pb;
pc=pc->next;
pb=pb->next;
}
else if(pa->data<pb->data){
pc->next=pa;
pc=pc->next;
pa=pa->next;
}
else {
pc->next=pa;
pc=pc->next;
u=pb;
pa=pa->next;
pb=pb->next;
free(u);
}
}
while(pa) {
pc->next=pa;
pc=pc->next;
pa=pa->next;
}
while(pb) {
pc->next=pb;
pc=pc->next;
pb=pb->next;
}
free(pb);
}
void Two(List &a,List &b,List &c){
pa=a->next;
pb=b->next;
c=pc=a;
c->next=NULL;
while(pa&&pb){
if(pa->data<=pb->data){
u=pa;
u->next=c->next;
c->next=u;
pa=pa->next;
}
else if(pa->data>pb->data){
u=pb;
u->next=c->next;
c->next=u;
pb=pb->next;
}
}
while(pa) {
u=pa;
u->next=c->next;
c->next=u;
pa=pa->next;
}
while(pb){
u=pb;
u->next=c->next;
c->next=u;
pb=pb->next;
}
free(b);
}
void Three(List &a,List &b,List &c){
pa=a->next;
pb=b->next;
c=pc=a;
while(pa&&pb){
if(pa->data>pb->data){
u=pb;
pb=pb->next;
free(u);
}
else if(pa->data<pb->data){
u=pa;
pa=pa->next;
free(u);
}
else {
u=pb;
pc->next=pa;
pc=pc->next;
pa=pa->next;
pb=pb->next;
free(u);
}
}
while(pa){
u=pa;
pa=pa->next;
free(u);
}
while(pb){
u=pb;
pb=pb->next;
free(u);
}
pc->next=NULL;
free(b);
}
void Four(List &a,List &b,List &c){
pa=a->next;
pb=b->next;
pre=a;
int n=0;
while(pa&&pb){
if(pa->data==pb->data){
pre->next=pa->next;
u=pa;
pa=pa->next;
pb=pb->next;
free(u);
}
if(pa->data>pb->data){
pb=pb->next;
}
else {
n++;
pre=pa;
pa=pa->next;
}
}
while(pa){
n++;
pa=pa->next;
}
while(pb){
u=pb;
pb=pb->next;
free(u);
}
free(b);
}
void Five(List &a){
b=pb=a;
pa=a->next;
c=new List();
pc=c;
c->next=NULL;
while(pa){
if(pa->data<0){
pb->next=pa;
pb=pb->next;
pa=pa->next;
}
else {
pc->next=pa;
pc=pc->next;
pa=pa->next;
}
}
}
void six(List a){
pmax=a->next;
pa=a->next;
while(pa){
if(pa->data>pmax->data){
pmax=pa;
}
pa=pa->next;
}
return pmax->data;
}
void seven(List &a){
pa=a->next;
pc=c=a;
c->next=NULL;
while(pa){
u=pa;
pa=pa->next;
u->next=c->next;
c->next=u;
}
}
void eight(List &a,int mink,int maxk){
pa=a->next;
pre=a;
while(pa){
if(pa->data>mink&&pa->data<maxk){
pre->next=pa->next;
u=pa;
pa=pa->next;
delete u;
}
else pa=pa->next;
}
}