I implement "stack" with C I

​​​​​​​

Catalog

​​​​​​​ One 、 Understand the structural characteristics of stack

  Two 、 Concrete realization

The code is as follows ：

---

One 、 Understand the structural characteristics of stack

1、 Stack is a special linear table , Only data is allowed in and out from one end , Called LIFO , First in, then out .

      Pressing stack ： Stack insertion is called stack entry / Pressing stack / Push , The input data is at the top of the stack

      Out of the stack ： The deletion of the stack is called out of the stack . The output data is also at the top of the stack

  Two 、 Concrete realization

Because stack is essentially a linear table , Therefore, it can be realized in two ways ： The order sheet   or   Linked list

Here I use a method similar to the sequence table to realize .

The code is as follows ：

typedef char Stacktype;
typedef struct Stack
{
    int top;
    Stacktype* data;
    int capacity;
}Stack;

void Stack_init(Stack* pphead);         // Initialization of stack 
void Stack_destory(Stack* pphead);      // Empty the stack 
void Stack_push(Stack* pphead, Stacktype data);  // insert data , Pressing stack 
void Stack_pop(Stack* pphead);          // Out of the stack （ Delete data ）
bool Stack_Empty(Stack* pphead);        // Judge whether the stack is empty 
Stacktype Stack_Top(Stack* pphead);     // Call out top of stack element 
int Stack_Size(Stack* pphead);          // Check the number of data 

// Initialization of stack 
void Stack_init(Stack* pphead)
{

    pphead->top = 0;
    pphead->capacity = 0;
    pphead->data = NULL;
}
// Empty the stack 
void Stack_destory(Stack* pphead)
{
    pphead->top = 0;
    pphead->capacity = 0;
    free(pphead->data);
    pphead->data = NULL;
}
// insert data , Pressing stack 
void Stack_push(Stack* pphead, Stacktype data)
{
    assert(pphead);
    if (pphead->top == pphead->capacity)
    {
        int Newcapacity = (pphead->capacity == 0) ? 4 : ((pphead->top) * 2);
        Stacktype* temp = NULL;
        temp = (Stacktype*)realloc(pphead->data, sizeof(Stacktype) * Newcapacity);
        if (temp == NULL)
        {
            printf("Stack_push");
            exit(-1);
        }
        pphead->data = temp;
        pphead->top = Newcapacity;
    }
    (pphead->data)[pphead->capacity] = data;
    pphead->capacity++;
}
// Out of the stack （ Delete data ）
void Stack_pop(Stack* pphead)
{
    assert(pphead);
    assert(Stack_Empty(pphead));
    pphead->capacity--;
}
// Judge whether the stack is empty 
bool Stack_Empty(Stack* pphead)
{
    assert(pphead);
    return pphead->capacity != 0;
}
// Call out top of stack element 
Stacktype Stack_Top(Stack* pphead)
{
    assert(pphead);
    assert(Stack_Empty(pphead));
    return pphead->data[pphead->capacity - 1];
}
// Check the number of data 
int Stack_Size(Stack* pphead)
{
    assert(pphead);
    return pphead->top;
}