-
Notifications
You must be signed in to change notification settings - Fork 0
/
1_train.cpp
101 lines (96 loc) · 1.67 KB
/
1_train.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
#include<bits/stdc++.h>
using namespace std;
typedef struct node{
int num;
struct node *left,*right;
} node
node *head,*run,*last,*use;
node* newnode(int num){
node *p;
p = (node *)malloc(sizeof(node));
p->num=num;
p->left = p->right = NULL;
return p;
}
void HEAD() {
run = head;
}
void NEXT() {
if(run->right!=NULL)
run = run->right;
}
void TAIL() {
run = last;
}
void ADD() {
int num;
scanf("%d",&num);
if(run == last) {
use = newnode(num);
use -> left = run;
run -> right = use;
last = use;
}
else {
use = newnode(num);
run->right->left = use;
use->right = run->right;
run->right=use;
use->left=run;
//while(last->right!=NULL)
//last=last->right;
}
}
void REMOVE() {
if(run==last) return;
use=run->right;
if(use->right!=NULL){
run->right = use->right;
run->right->left=run;
}
else {
run->right=NULL;
last=run; // ADD THIS
}
free(use);
//for(last=run;last->right!=NULL;)
//last=last->right;
}
void CALL() {
printf("%d\n", run->num);
}
void LIST() {
while(run->right!=NULL) {
printf("%d ",run->num);
run=run->right;
}
printf("%d\n",run->num);
}
int main() {
int n,i;
char a[100];
scanf("%d",&n);
head = newnode(999);
run = newnode(0);
last = newnode(0);
use = newnode(0);
run = last = head;
for(i=0;i<n;i++){
scanf(" %s",a);
if(!strcmp(a,"head"))
HEAD();
else if(!strcmp(a,"next"))
NEXT();
else if(!strcmp(a,"tail"))
TAIL();
else if(!strcmp(a,"add"))
ADD();
else if(!strcmp(a,"remove"))
REMOVE();
else if(!strcmp(a,"call"))
CALL();
else if(!strcmp(a,"list"))
LIST();
}
return 0;
}