009.栈应用行编辑程序C实例

#include <stdio.h>
#include <stdlib.h>

#define OK 1
#define OVERFLOW -2
#define ERROR -1

#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10

typedef int status;
typedef char elemType;

typedef struct{
    elemType* base;
    elemType* top;
    int stacksize;
}SqStack;

status initStack(SqStack* S)
{
    S->base=(elemType*)malloc(STACK_INIT_SIZE*sizeof(elemType));
    if(!S->base)
        exit(OVERFLOW);
    S->top=S->base;
    S->stacksize=STACK_INIT_SIZE;
    return OK;
}

status push(SqStack* S,elemType e)
{
    if(S->top-S->base >= S->stacksize)
    {
        S->base=(elemType*)realloc(S->base,(S->stacksize+STACKINCREMENT)*sizeof(elemType));
        if(!S->base)
            exit(OVERFLOW);
        S->top=S->base+S->stacksize;
        S->stacksize+=STACKINCREMENT;
    }
    *S->top++=e;
    return OK;
}

status pop(SqStack* S,elemType* e)
{
    if(S->base==S->top)
        return ERROR;
    *e=*--S->top;
    return OK;
}

status clearStack(SqStack *S)
{
    if(S->top!=S->base)
        S->top=S->base;
    return OK;
}

status destroyStack(SqStack *S)
{
    free(S->base);
    return OK;
}

status saveStack(SqStack S)
{
    elemType* n;
    FILE* fp;
    n=S.base;
    fp=fopen("d:/download/test.txt","a+");
    while(n!=S.top)
    {
        fputc(*n++,fp);
    }
    fclose(fp);
    return OK;
}

status lineEdit()
{
    SqStack S;
    elemType c;
    elemType ch;

    initStack(&S);
    ch=getchar();
    while(ch!=EOF)
    {
        while(ch!=EOF && ch!='\n')
        {
            switch(ch)
            {
                case '#':
                    pop(&S,&c);
                    break;
                case '@':
                    clearStack(&S);
                    break;
                default:
                    push(&S,ch);
                    break;
            }
            ch=getchar();
        }
        saveStack(S);
        clearStack(&S);
        if(ch!=EOF)
            ch=getchar();
    }
    destroyStack(&S);
}

int main()
{
    lineEdit();
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值