datastructure/Stack.cpp at master · sungpyo9053/datastructure · 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
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <string>


const char stackSize = 30;
char stack[stackSize];
int top;

using namespace std;

void create_stack();
void push(char num);
void displayStack();
char pop();
int isFull();
int isEmpty();

void create_stack() //스텍 생성
{
  top = -1;
}

void push(char num) //값 입력
{

  stack[++top] = num;
}

char pop()  //출력
{

  return stack[top--];
}

int isFull()
{
  if(top==stackSize-1)
    return 1;
  else
    return 0;
}

int isEmpty()
{
  if(top==-1)
    return 1;
  else
    return 0;
}

void displayStack()  //스택 나열
{

  if(isEmpty())
    cout << "Stack is empty!" << endl;
  else
  {
    for(int sp = 0 ; sp <=top ; sp++)
    {
      cout << stack[sp] << " ";
    }
    cout << endl;
  }
}

int main(){
}