자료구조

[자료구조_Day3]Stack

Whatman 2018. 11. 6. 17:19

■Stack■

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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
/*****************************************************************************
*                                                                            *
*  ------------------------------- stack.c --------------------------------  *
*                                                                            *
*****************************************************************************/
 
#include <stdlib.h>
#include<stdio.h>
#include<string.h>
 
#include "list.h"
#include "stack.h"
 
/*****************************************************************************
*                                                                            *
*  ------------------------------ stack_push ------------------------------  *
*                                                                            *
*****************************************************************************/
 
int stack_push(Stack *stack, const void *data) {
 
/*****************************************************************************
*                                                                            *
*  Push the data onto the stack.                                             *
*                                                                            *
*****************************************************************************/
 
 
return list_ins_next(stack, NULL, data);
 
}
 
/*****************************************************************************
*                                                                            *
*  ------------------------------ stack_pop -------------------------------  *
*                                                                            *
*****************************************************************************/
 
int stack_pop(Stack *stack, void **data) {
 
/*****************************************************************************
*                                                                            *
*  Pop the data off the stack.                                               *
*                                                                            *
*****************************************************************************/
 
return list_rem_next(stack, NULL, data);
 
}
 
 
 
void main(void) {
 
 
    Stack stack;
    stack_init(&stack, free);
    
    
    start(&stack);
 
}
 
int list_menu(void) {
 
    int i;
 
    do {
 
        printf("\nStackt Menu\n");
 
        printf("1. stack push\n");
 
        printf("2. stack pop\n");
        
        printf("3. Display stack\n");
 
        printf("0. Quit\n");
 
        printf("Input Operation : ");
 
        scanf("%d", &i);
 
    } while(i<0 || i>10);
 
    return i;
 
}
 
 
void start(Stack* stack) {
 
    int i;
 
    void *data;
    char temp[100];
    char * str,*str2;
 
 
    while((i=list_menu())!=0) {
 
        switch(i) {
 
 
            case 1 :
 
            printf(">Input data : ");
            fflush(stdin);
            gets(temp); 
            str = (char *)malloc(sizeof(temp)+1);
            strcpy(str,temp);
            stack_push(&stack, str);
            break;
            
            case 2 :
 
            if(list_rem_next(&stack, NULL, (void **)&data)!=0)
 
            printf("The data is not exist\n");
 
            break;
            
            case 3 :
 
                print_stack(&stack);  
 
                break;
 
        }
 
    }
 
 
    exit(0);
 
}
 
void print_stack(Stack *stack)
{
    void *data;
    char temp[100];
    
    ListElmt *ST;
 
    ST=stack->head;
    
    
    if(ST==NULL) {
    printf("There is not data\n");
    return;
    }
        
    while(1) {
        
            strcpy(temp,(char *)(ST->data));
            
            if(is_check(temp))
            printf("%s    ", (char *)(ST->data) );
            else
            printf("%d    ",atoi((char *)(ST->data) ));
            
        if(ST->next==NULL)
            break;
 
        else
            ST=(ST->next);
    }
 
}
int is_check(char* temp)
{
    int i;
    for(i=0;i<strlen(temp);i++)
            if(temp[i]<'0' ||temp[i]>'9')
            {
                return 1;
            }
        return 0;
}
cs