edit.cpp

自己写的数据结构代码

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


#define OK 1
#define ERROR 0
typedef char SElemType;
typedef int Status;
#define STACK_INIT_SIZE 100000
#define STACKINCREMENT 2

struct SqStack
{
	SElemType *base;
	SElemType *top;
	int stacksize;
};

FILE *fp;

Status InitStack(SqStack &S)
{
	S.base=(SElemType *)malloc(STACK_INIT_SIZE*sizeof(SElemType));
	S.top=S.base;
	S.stacksize=STACK_INIT_SIZE;
	return OK;
}

Status Push(SqStack &S,SElemType e)
{
	if(S.top-S.base>=S.stacksize)
	{
		S.base=(SElemType *)realloc(S.base,(S.stacksize+STACKINCREMENT)*sizeof(SElemType));
		
		S.top=S.base+S.stacksize;
		S.stacksize=S.stacksize+STACKINCREMENT;
	}
	*S.top++=e;
	
	return OK;
}

Status Pop(SqStack &S,SElemType &e)
{
	if(S.top==S.base) return ERROR;
	
	e=* --S.top;
	return OK;
}

Status ClearStack(SqStack &S)
{
	S.top=S.base;
	return OK;
}

Status DestroyStack(SqStack &S)
{
	free(S.base);
	S.base=NULL;
	S.top=NULL;
	S.stacksize=0;
	return OK;
}

Status visit(SElemType c) 
{ 
	printf("%c",c); 
	return OK; 
} 

Status StackTraverse(SqStack S,Status(*visit)(SElemType)) 
{ 
	while(S.top>S.base) 
		visit(*S.base++); 
	printf("\n"); 
	return OK; 
} 

void LineEdit()
{
	SqStack s;
	char ch,c;
	int n,i;
	InitStack(s);
	scanf("%d",&n); 
	ch=getchar();
	for(i=1;i<=n;i++)
	{
		ch=getchar();
		while(ch!='\n')
		{
			switch(ch)
			{
			case '#':Pop(s,c);
				break;
			case '@':ClearStack(s);
				break;
			default:Push(s,ch);
			}
			ch=getchar();
		}
		StackTraverse(s,visit);
		ClearStack(s);
	}
	DestroyStack(s);
}

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