algorithm/10828_stack.c at master · dampers/algorithm · GitHub

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
# include <stdio.h>

int top = 0;
int stack[10000];
char order[10];

void push(int p)
{
	stack[top++] = p;
}

void pop()
{
	if(top)
	{
		printf("%d\n", stack[--top]);
		stack[top] = 0;
	}
	else printf("-1\n");
}

void size()
{
	printf("%d\n", top);
}

void empty()
{
	if(top) printf("0\n");
	else printf("1\n");
}

void topk()
{
	if(stack[top-1]) printf("%d\n", stack[top-1]);
	else printf("-1\n");
}

int main()
{
	int t, i, j;
	scanf("%d", &t);
	for(i=0;i<t;i++)
	{
		scanf("%s", order);
		if(strcmp(order, "push") == 0)
		{
			int k;
			scanf("%d", &k);
			push(k);
		}
		else if(strcmp(order,"pop")==0)
		{
			pop();
		}
		else if(strcmp(order,"size")==0)
		{
			size();
		}
		else if(strcmp(order,"empty")==0)
		{
			empty();
		}
		else if(strcmp(order,"top")==0)
		{
			topk();
		}
		for(j=0;j<10;j++)
		{
			order[j] = '\0';
		}
	}
	return 0;
}