链栈的输入和删除(压栈和出栈)

#include
#include
typedef struct node
{
	int data;
	struct node *next;
}*PLinkStackNode,LinkStackNode;
//初始化
PLinkStackNode init(PLinkStackNode *L)
{
	*L = (PLinkStackNode)malloc(sizeof(LinkStackNode));
	(*L)->next = NULL;
	return *L;
}
//和单链表的头插法类似
int Push(PLinkStackNode L,int x)
/*将数据元素x压入到栈L中*/
{
	//链表的表头指针就作为栈顶指针,其始终指向当前栈顶元素前面的头结点  
	PLinkStackNode temp;
	temp = (PLinkStackNode)malloc(sizeof(LinkStackNode));  //新的结点的值
	if(temp == NULL)
	{
		return 0;//申请空间失败
	}
	temp->data = x;
	temp->next = L->next;         //修改当前的栈顶指针
	L->next = temp;
	return 1;
}
//和单链表的删除相似
int Pop(PLinkStackNode L,int *x)
{
	PLinkStackNode temp;
	temp = L->next;
	if(temp==NULL)
		return 0;//栈为空
	*x = temp->data;
	L->next = temp->next;
	free(temp);
	return 1;
}
int main()
{
	int a[6] = {1,2,3,4,5,6};
	int i;
	int x;
	
	PLinkStackNode Ls;
	Ls = init(&Ls);//初始化

	for(i = 0;i < 6;i++)
	{
		Push(Ls,a[i]);
	} 

	printf("将栈的元素输出:\n");
	for(i = 0;i < 6;i++)
	{
		Pop(Ls,&x);
		printf("%d	",x);
	}
	printf("\n ");
	return 0;
}

 

转载于:https://my.oschina.net/u/2537693/blog/810302

你可能感兴趣的:(链栈的输入和删除(压栈和出栈))