无头单向链表

#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>


typedef int SLDataType;
//无头单向链表结构体
typedef struct SListNode{
	SLDataType data;
	struct SListNode* next;
}SListNode,*SL;

typedef struct SList{
	SL head;
}SList,*sl;

//初始化
void SListInit(SList* plist){
	plist->head = NULL;
}

//销毁
void SListDestroy(SList* plist){
	SListNode* next;
	for (SListNode *cur = plist->head; cur != NULL; cur = next){
		next = cur->next;
		//free(cur);
	}
	plist->head = NULL;
	if (plist){
		printf("销毁成功\n");
	}
}
//创建节点
SLDataType* BuySListNode(SLDataType x){
	SL new_node = (SListNode*)malloc(sizeof(SListNode*));
	if (new_node == NULL){
		return -1;//创建空间失败
	}
	//赋值
	new_node->data = x;
	new_node->next = NULL;
	return new_node;
}

//头插
void SListPushFront(SList* plist, SLDataType x){
	assert(plist);
	SListNode* Node = NULL;
	Node = BuySListNode(x);
	Node->next = plist->head;
	plist->head = Node;
}


//尾插
void SListPushBack(SList* plist, SLDataType x){
	assert(plist);
	if (plist->head == NULL)
	{
		SListPushFront(plist, x);
		return;
	}
	SListNode* cur = plist->head;
	SListNode* node = BuySListNode(x);
	for (; cur->next != NULL; cur = cur->next)
	{
		;
	}
	cur->next = node;
}

//头删
void SListPopFront(sl plist){
	assert(plist);
	assert(plist->head != NULL);
	SL cur = plist->head;
	plist->head =cur->next;
	//free(cur);
}



//尾删
void SListPopBack(SList* plist){
	assert(plist);
	assert(plist->head != NULL);
	SListNode* cur = plist->head;
	for (; cur->next->next != NULL; cur = cur->next){
		;
	}
	//free(cur->next);
	cur->next = NULL;
}
//打印
void SListPrint(SList* plist){
	assert(plist);
	for (SListNode* cur = plist->head; cur != NULL; cur = cur->next){
		printf("%d -> ", cur->data);
	}
	printf("NULL\n");
}


int main(){
	SList list;
	SListInit(&list);
	SListPushFront(&list, 3);
	SListPushFront(&list, 2);
	SListPushFront(&list, 1);
	SListPushBack(&list, 4);
	SListPrint(&list);
	SListPopBack(&list);
	SListPrint(&list);
	SListPopFront(&list);
	SListPrint(&list);
	SListDestroy(&list);
	system("pause");
	return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值