数据结构学习第六天

17:07:38 2019-08-21

学习

 18:11:59 2019-08-21

完善了对栈 队列的测试

栈的数组实现

StackInArray.h

#ifndef _STACK_IN_ARRAY_H
#define _STACK_IN_ARRAY_H
#define Empty -1
struct AStack;
typedef struct AStack* Stack;
int IsEmpty(Stack S);
int IsFull(Stack S);
Stack CreatAStack(int MaxSize);
void DisposeAStack(Stack S);
void MakeEmpty(Stack S);
void Push(int Element, Stack S);
int Top(Stack S);
void Pop(Stack S);
int TopAndPop(Stack S);
#endif // !_STACK_IN_ARRAY_H

StackInArray.c

#include"StackInArray.h"
#include<malloc.h>
#include<stdio.h>
struct AStack
{
    int Capacity;
    int TopOfStack;
    int* Array;
};
int IsEmpty(Stack S)
{
    return S->TopOfStack == Empty;
}

int IsFull(Stack S)
{
    return S->TopOfStack == (S->Capacity - 1);
}

Stack CreatAStack(int MaxSize)
{
    Stack S = (Stack)malloc(sizeof(AStack));
    S->Capacity = MaxSize;
    S->Array = (int*)malloc(sizeof(int) * S->Capacity);
    MakeEmpty(S);
    return S;
}

void DisposeAStack(Stack S)
{
    if (S)
    {
        free(S->Array);
        free(S);
    }
}

void MakeEmpty(Stack S)
{
    S->TopOfStack = Empty;
}

void Push(int Element, Stack S)
{
    if (IsFull(S))
    {
        printf("out of space
");
        return;
    }
    else
    {
        S->Array[++S->TopOfStack] = Element;
    }
}

int Top(Stack S)
{
    if (IsEmpty(S))
    {
        printf("stack is empty
");
        return -1;
    }
    else
    {
        return S->Array[S->TopOfStack];
    }
}

void Pop(Stack S)
{
    if (IsEmpty(S))
    {
        printf("stack is empty
");
        return;
    }
    else
    {
        S->TopOfStack--;
    }
}

int TopAndPop(Stack S)
{
    if (IsEmpty(S))
    {
        printf("stack is empty
");
        return -1;
    }
    else
    {
        /*int Element = S->Array[S->TopOfStack];
        Pop(S);
        return Element;*/
        return S->Array[S->TopOfStack--];
    }
}

main.c

#include<stdio.h>
#include"StackInArray.h"

int main()
{
    Stack S;
    S = CreatAStack(20);
    printf("%10d %10d
", IsEmpty(S), IsFull(S));
    Push(25, S);
    printf("%10d %10d
", IsEmpty(S), IsFull(S));
    printf("%10d
", Top(S));
    Push(30, S);
    printf("%10d ",TopAndPop(S));
    printf("%10d
", Top(S));
    Pop(S);
    printf("%10d
", IsEmpty(S));
    Pop(S);
    return 0;
}

写的过程中注意到了 printf 对参数压栈顺序

查了下资料 有__cdecl 这样的一个默认的调用约定(对c和c++来说都是)  表示C语言默认的函数调用方法：所有参数从右到左依次入栈，这些参数由调用者清除，称为手动清栈。

我用的ide是vs2019

调试时会发现 先进入 fun2() 再进入fun1()  

 函数读参数也是如同进栈一般  

先进入fun2() 返回值为1 把1进栈

再进入fun1() 返回值为2 把2进栈  

那么出栈后是2 1