//输入整数序列,栈存储,a≠-1时入栈,a=-1时将栈顶出栈并输出,算法应对异常给出相应信息
//虽然知道题目该用顺序栈,但是姑且也该复习一下链栈了
#ifndef PCH_H
#define PCH_H
#include<stdio.h>
#include<iostream>
#include<cstdlib>
#include<malloc.h>
#include<math.h>
constexpr auto MAXSIZE = 10;
constexpr auto ERROR = 0;
constexpr auto OK = 1;
typedef int Status;
// TODO: 添加要在此处预编译的标头
typedef struct StackNode
{
int data;//整数序列数据域
struct StackNode *next;
}StackNode,* LinkStack;
int length;
Status InitStack(LinkStack &S);
Status Pop(LinkStack &S,int &e);//x记录弹出的值
Status Push(LinkStack &S, int e);
Status EmptyStack(LinkStack S);//判断するべき
Status StackFull(LinkStack S);
void Record();//执行算法
#endif //PCH_H
----------------------------------------------------------------------------------
// pch.cpp: 与预编译标头对应的源文件;编译成功所必需的
#include "pch.h"
// 一般情况下,忽略此文件,但如果你使用的是预编译标头,请保留它。
Status InitStack(LinkStack & S)
{
S = NULL;
length = 0;
return OK;
}
Status Pop(LinkStack & S, int & e)
{
StackNode *q;
if (EmptyStack(S)) return ERROR;
e = S->data;
q = S;
S = S->next;
delete q;
return OK;
}
Status Push(LinkStack & S, int e)
{
if (StackFull(S)) return ERROR;
StackNode *q=(LinkStack )malloc(sizeof(StackNode));
q->data = e;
q->next = S;
S = q;
length++;
return OK;
}
Status EmptyStack(LinkStack S)
{
if(!S) return OK;
return ERROR;
}
Status StackFull(LinkStack S)
{
if (length == MAXSIZE) return OK;
return ERROR;
}
void Record()
{
LinkStack S;
InitStack(S);
int e;//记录每一个录入的数据
std::cout << "please input your data!"<<"\n";
for (int i = 0;; i++)
{
std::cin >> e;
if (StackFull(S))
{
std::cout << "fullstack! And the top of the stack is : "
<<S->data;//栈满给出相应信息?
return ;
}
if (e == -1&&!EmptyStack(S))//是结束符吧?
{
Pop(S,e);
std::cout << e;
return;
}
else
{
Push(S, e);
continue;
}
return ;
}
}
--------------------------------------------
#include "pch.h"
#include <iostream>
int main()
{
Record();
}
整数序列链栈存储
最新推荐文章于 2022-12-21 08:39:23 发布