2-5 Two Stacks In One Array

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

x1aolata

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

阅读量176

点赞数

分类专栏：数据结构文章标签：数据结构

本文链接：https://blog.csdn.net/weixin_43728310/article/details/101074155

版权

这篇博客探讨如何利用一个数组来实现两个独立的栈。内容包括设计相应的push和pop操作，确保在数组满载时才报溢出错误，并提供了一个示例程序说明栈操作的逻辑。

摘要由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,