데이터 구조 - C 언어 는 스 택 의 초기 화, 입, 출, 스 택 지붕 보기 등 작업 을 실현 합 니 다.

#define _CRT_SECURE_NO_WARNINGS 1

#include 
#include 
#include 

#define length 10

typedef int DataType;
typedef int size_t;

typedef struct Stack
{
	DataType* _top;
	DataType* _end; //    
	int stackSize;
}Stack;

//        
void StackInit(Stack* s);//    
void StackPush(Stack* s, DataType x);//  
DataType StackPop(Stack* s);//  
DataType StackTop(Stack* s);//    
size_t StackSize(Stack* s);//    
int StackEmpty(Stack* s);//  

int main()
{
	Stack s;
	int x;
	int i;
	StackInit(&s);

	StackPush(&s, 2);
	StackPush(&s, 5);
	StackPush(&s, 3);

	//x = StackTop(&s);
	//x = StackTop(&s);
	//x = StackTop(&s);

	//x = StackPop(&s);
	//x = StackPop(&s);
	//x = StackPop(&s);

	x = StackSize(&s);

	i = s.stackSize;
	printf("%d,%d",i,x);
	system("pause");
	return 0;
}

void StackInit(Stack* s)
{
	//      
	s->_end = (DataType*)malloc(length * sizeof(DataType));
	//        
	if (!s->_end)
	{
		exit(0);
	}
	//        
	s->_top = s->_end;//         
	s->stackSize = length;
	return;
}

void StackPush(Stack* s, DataType x)
{
	//  
	assert(s);
	if (s->stackSize == s->_top - s->_end)
	{
		printf("    ,    ");
		s->_end = (DataType*)realloc(s->_end, (s->stackSize + length) * sizeof(DataType));
		if (!s->_end)
		{
			exit(0);
		}
		s->_top = s->_end + s->stackSize;//    
		s->stackSize += length;//     
	}
	*(s->_top) = x;//  x
	s->_top++;
	return;
}

DataType StackPop(Stack* s)
{
	assert(s);
	if (StackEmpty(s))
	{
		printf("   ");
		return;
	}
	return *--(s->_top);
}

DataType StackTop(Stack* s)
{
	assert(s);
	if (StackEmpty(s))
	{
		printf("   ");
		return;
	}
	return *(s->_top - 1);
}

size_t StackSize(Stack* s)
{
	return (s->_top - s->_end);
}

int StackEmpty(Stack* s)
{
	return 0 == (s->_top - s->_end);
}