zoukankan      html  css  js  c++  java
  • 堆C数组实现

    堆栈是一个最后出来该数据结构.

    栈的基本操作包含:入栈,出栈,初始化栈,清空栈,遍历栈.


    C代码例如以下:

    #include <stdio.h>
    
    #define MaxSize 20
    typedef int ElemType;
    
    
    typedef struct stack
    {
        ElemType Data[MaxSize];
        int top;
    }Stack;
    
    //初始化栈
    void InitStack(Stack *S)
    {
        S->top=-1;
    }
    
    //入栈
    void PushStackValue(Stack *S)
    {
        printf("Input the Value of stack member:
    (0-exit)
    ");
        int value;
        printf("Please input the 1st value of stack:
    ");
        scanf("%d",&value);
        S->Data[++S->top]=value;
        while(value)
        {
            S->top++;
            printf("Please input the %dst value of stack:
    ",S->top+1);
            scanf("%d",&value);
            S->Data[S->top]=value;
        }
    }
    
    //出栈
    void PopStackValue(Stack *S)
    {
        if(S->top>=0)
        {
            printf("the stack %dst value pop out: %d
    ",S->top+1,S->Data[--S->top]);
        }
        else
        {
            printf("The Stack is empty
    ");
        }
    }
    
    //推断栈空
    void IsEmpty(Stack *S)
    {
        if(S->top==-1)
        {
            printf("The Stack is empty.
    ");
        }
        else
        {
            printf("The stack is not empty.
    ");
        }
    }
    
    
    //清空栈
    void ClearStack(Stack *S)
    {
        S->top=-1;
    }
    
    //遍历栈
    void ScanStack(Stack *S)
    {
        int i;
        int len=S->top-1;
        int StackArray[len];
        for(i=len;i>0;i--)
        {
            StackArray[i]=S->Data[i--];
        }
        printf("The all stack member(from top to bottom) is:
    ");
        while(len>=0)
        {
            printf("%d ",S->Data[len--]);
        }
        printf("
    ");
    }
    
    void main()
    {
        Stack S;
    
        InitStack(&S);
        PushStackValue(&S);
        ScanStack(&S);
        IsEmpty(&S);
        PopStackValue(&S);
        PopStackValue(&S);
        PopStackValue(&S);
        PopStackValue(&S);
    }
    


    执行结果例如以下:




    转载请注明:刘

    版权声明:本文博客原创文章。博客,未经同意,不得转载。

  • 相关阅读:
    py4CV例子2汽车检测和svm算法
    py4CV例子1猫狗大战和Knn算法
    KNN(K-Nearest Neighbor)介绍
    从机器学习谈起
    基于QProbe创建基本Android图像处理框架
    qtquickcontrols2控件集(使用参考重构)
    QtQuickcontrols2控件使用参考
    QTQuick控件基础(3)视图
    QTQuick控件基础(2)
    在win和android上同时进行OpenCV程序设计
  • 原文地址:https://www.cnblogs.com/zfyouxi/p/4622133.html
Copyright © 2011-2022 走看看