做企业平台的网站有哪些内容抖音seo优化软件

/**
* @author huihut
* @E-mail:huihut@outlook.com
* @version 创建时间：2016年9月9日
* 说明：本程序实现了一个顺序栈。
* 功能：有初始化、销毁、判断空、清空、入栈、出栈、取元素的操作。
*/#include "stdio.h"
#include "stdlib.h"
#include "malloc.h"//5个常量定义
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define OVERFLOW -1//测试程序长度定义
#define LONGTH 5//类型定义
typedef int Status;
typedef int ElemType; //顺序栈的类型
typedef struct {ElemType *elem;int top;int size;int increment;
} SqSrack;//函数声明
Status InitStack_Sq(SqSrack &S, int size, int inc);  //初始化顺序栈
Status DestroyStack_Sq(SqSrack &S);                    //销毁顺序栈
Status StackEmpty_Sq(SqSrack S);                    //判断S是否空，若空则返回TRUE，否则返回FALSE
void ClearStack_Sq(SqSrack &S);                        //清空栈S
Status Push_Sq(SqSrack &S, ElemType e);                //元素e压入栈S
Status Pop_Sq(SqSrack &S, ElemType &e);                //栈S的栈顶元素出栈，并用e返回
Status GetTop_Sq(SqSrack S, ElemType &e);            //取栈S的栈顶元素，并用e返回//初始化顺序栈
Status InitStack_Sq(SqSrack &S, int size, int inc) {S.elem = (ElemType *)malloc(size * sizeof(ElemType));if (NULL == S.elem) return OVERFLOW;S.top = 0;S.size = size;S.increment = inc;return OK;
}//销毁顺序栈
Status DestroyStack_Sq(SqSrack &S) {free(S.elem);S.elem = NULL;return OK;
}//判断S是否空，若空则返回TRUE，否则返回FALSE
Status StackEmpty_Sq(SqSrack S) {if (0 == S.top) return TRUE;return FALSE;
}//清空栈S
void ClearStack_Sq(SqSrack &S) {if (0 == S.top) return;S.size = 0;S.top = 0;
}//元素e压入栈S
Status Push_Sq(SqSrack &S, ElemType e) {ElemType *newbase;if (S.top >= S.size) {newbase = (ElemType *)realloc(S.elem, (S.size + S.increment) * sizeof(ElemType));if (NULL == newbase) return OVERFLOW;S.elem = newbase;S.size += S.increment;}S.elem[S.top++] = e;return OK;
}//取栈S的栈顶元素，并用e返回
Status GetTop_Sq(SqSrack S, ElemType &e) {if (0 == S.top) return ERROR;e = S.elem[S.top - 1];return e;
}//栈S的栈顶元素出栈，并用e返回
Status Pop_Sq(SqSrack &S, ElemType &e) {if (0 == S.top) return ERROR;e = S.elem[S.top - 1];S.top--;return e;
}int main() {//定义栈S
    SqSrack S;//定义测量值int size, increment, i;//初始化测试值size = LONGTH;increment = LONGTH;ElemType e, eArray[LONGTH] = { 1, 2, 3, 4, 5 };//显示测试值printf("---【顺序栈】---\n");printf("栈S的size为：%d\n栈S的increment为：%d\n", size, increment);printf("待测试元素为：\n");for (i = 0; i < LONGTH; i++) {printf("%d\t", eArray[i]);}printf("\n");//初始化顺序栈if (!InitStack_Sq(S, size, increment)) {printf("初始化顺序栈失败\n");exit(0);}printf("已初始化顺序栈\n");//入栈for (i = 0; i < S.size; i++) {if (!Push_Sq(S, eArray[i])) {printf("%d入栈失败\n", eArray[i]);exit(0);}}printf("已入栈\n");//判断非空if(StackEmpty_Sq(S)) printf("S栈为空\n");else printf("S栈非空\n");//取栈S的栈顶元素    printf("栈S的栈顶元素为：\n");printf("%d\n", GetTop_Sq(S, e));    //栈S元素出栈printf("栈S元素出栈为：\n");for (i = 0, e = 0; i < S.size; i++) {printf("%d\t", Pop_Sq(S, e));}  printf("\n");//清空栈S
    ClearStack_Sq(S);printf("已清空栈S\n"); return 0;                              
}