2-5 Two Stacks In One Array (20 分)

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

muzir～

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

阅读量120

点赞数 1

分类专栏：数据结构文章标签：链表数据结构 c语言

本文链接：https://blog.csdn.net/muzir_/article/details/121578678

版权

这篇博客介绍如何用一个数组实现两个独立的栈，详细解释了数据结构的设计，并提供了相关操作函数，如创建栈、检查栈的状态、压入元素、弹出元素等。博主在实现过程中遇到一些困难，但未给出完整的解决方案。

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

2-5 Two Stacks In One Array (20 分)
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;

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 );

Operation GetOp(); /* details omitted /
void PrintStack( Stack S, int Stacknum ); / details omitted */

int main()
{
int N, Sn, X;
Stack S;
int done = 0;

scanf("%d", &N);
S = CreateStack(N);
while ( !done ) {
    switch( GetOp() ) {
    case push: 
        scanf("%d %d", &Sn, &X);
        if (!Push(X, S, Sn)) printf("Stack %d is Full!\n", Sn);
        break;
    case pop:
        scanf("%d", &Sn);
        X = Top_Pop(S, Sn);
        if ( X==ERROR ) printf("Stack %d is Empty!\n", Sn);
        break;
    case end:
        PrintStack(S, 1);
        PrintStack(S, 2);
        done = 1;
        break;
    }
}
return 0;

}

/* Your function will be put here */
Sample Input:
5
Push 1 1
Pop 2
Push 2 11
Push 1 2
Push 2 12
Pop 1
Push 2 13
Push 2 14
Push 1 3
Pop 2
End
结尾无空行
Sample Output:
Stack 2 is Empty!
Stack 1 is Full!
Pop from Stack 1: 1
Pop from Stack 2: 13 12 11
这道题其实就是把一个栈设两个栈底指针，一个指向-1向上走，一个指向MaxSize向下走，这样就分成了两个栈，但是程序死活成功不了，吐了,就这样吧，以后如果能成功了再改吧。

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

typedef struct StackRecord *Stack;
struct StackRecord
{
   
    int Capacity;
    int Top1;
    int Top2;
    ElementType *Array;
};
Stack CreateStack(int MaxElements);
Stack CreateStack(int MaxElements)
{
   
    Stack p=(Stack)malloc(sizeof(struct StackRecord));
    p->Array=(int *)malloc(MaxElements*sizeof(int));
    p->Top1=-1;
    p->Top2=MaxElements;
    p->Capacity=