复习——2-5 Two Stacks In One Array(两个栈共用一个共享空间)

最新推荐文章于 2022-09-18 09:17:15 发布

wyx_601

最新推荐文章于 2022-09-18 09:17:15 发布

阅读量386

点赞数

分类专栏：算法 C语言

本文链接：https://blog.csdn.net/wyx_601/article/details/109460104

版权

这篇博客介绍了如何使用一个数组来实现两个栈，栈的操作不会在数组未满之前声明溢出。讨论了函数格式、示例程序，并提供了具体代码实现。

摘要由CSDN通过智能技术生成

Write routines to implement two stacks using only one array. Your stack routines should not declare an overflow unless every slot in the array is used.

Format of functions:

Stack CreateStack( int MaxElements );
int IsEmpty( Stack S, int Stacknum );
int IsFull( Stack S );
int Push( ElementType X, Stack S, int Stacknum );
ElementType Top_Pop( Stack S, int Stacknum );

where int Stacknum is the index of a stack which is either 1 or 2; int MaxElements is the size of the stack array; and Stack is defined as the following:

typedef struct StackRecord *Stack;
struct StackRecord  {
   
    int Capacity;       /* maximum size of the stack array */
    int Top1;           /* top pointer for Stack 1 */
    int Top2;           /* top pointer for Stack 2 */
    ElementType *Array; /* space for the two stacks */
}

Note: Push is supposed to return 1 if the operation can be done successfully, or 0 if fails. If the stack is empty, Top_Pop must return ERROR which is defined by the judge program.

Sample program of judge:

#include <stdio.h>
#include <stdlib.h>
#define ERROR 1e8
typedef int ElementType;
typedef enum {
    push, pop, end } Operation;

typedef struct StackRecord *<