博客
关于我
数据结构 链表【单向链表的初始化,头插法建立,尾插法建立,插入,删除】
阅读量:116 次
发布时间:2019-02-26

本文共 3155 字,大约阅读时间需要 10 分钟。

???????

??

??????????????????????????????????????????

???????

?????

????????????? Node???????? data ???? next?LinkedList ??? Node ??????????????

typedef struct Node{	int data;	Node* next;}Node,*LinkedList;

?????

???????? LinkedListInit ???????????????????

LinkedList LinkedListInit(){	Node* L;	L = (Node*)malloc(sizeof(Node));	if (L == NULL)	{		cout << "?????????" << endl;	}	return L;}

????

  • ???????L = (Node*)malloc(sizeof(Node)); ???? Node ???
  • ???????? L ???????????????
  • ??????????????? L ?????????
  • ??

    ?????????????????

    int main(){	LinkedList p;	p = LinkedListInit();	p->data = 5;	cout << p->data;	free(p);	return 0;}

    ???????????

    ????

    ?????????????

    LinkedList LinkedListCreatH(){	Node* L = LinkedListInit();	L->next = NULL;	int x;	while (scanf("%d", &x) != EOF)	{		Node* p;		p = (Node*)malloc(sizeof(Node));		p->data = x;		p->next = L->next;		L->next = p;	}	return L;}

    ????

  • ????????? LinkedListInit ?????????? next ? NULL?
  • ????????? scanf ????????? EOF?
  • ??????????????????? p???????????
  • ???????????? next ????? p?
  • ???????????

    ????

    ???????????

    LinkedList LinkedListCreatH(){	Node* L = LinkedListInit();	L->next = NULL;	Node* r;	r = L;	int x;	while (scanf("%d", &x) != EOF)	{		Node* p;		p = (Node*)malloc(sizeof(Node));		p->data = x;		r->next = p;		r = p;	}	r->next = NULL;	return L;}

    ????

  • ??????????????????? L???? next ?? NULL?
  • ????? r?r ????? L?
  • ???????????????????? EOF?
  • ?????????? p ?????????? r ???? p?
  • ?????????? r ? next ?? NULL??????????
  • ??????

    ????

    ????????????

    LinkedList LinkedListInsert(LinkedList L, int i, int x){	Node* pre;	pre = L;	int tempi = 0;	for (tempi = 1; tempi < i; tempi++)	{		pre = pre->next;	}	Node* p;	p = (Node*)malloc(sizeof(Node));	p->data = x;	p->next = pre->next;	pre->next = p;	return L;}

    ????

  • ?????? pre??????? L ???
  • ????????????????????????? pre?
  • ???????????????? p?
  • ???????????????pre->next ????? p?p->next ?? pre->next?
  • ??????

    ????

    ????????????

    LinkedList LinkedListDelete(LinkedList L, int i){	if (i < 1)		cout << "???????1?????" << endl;	Node* pre;	pre = L;	int tempi = 0;	for(tempi = 1;tempi < i;tempi++)	{		pre = pre->next;	}	Node* p = pre->next;	pre->next = p->next;	free(p);	return L;}

    ????

  • ??????????? i ????????
  • ????? pre?????????????????? pre?
  • ?????? p?p ? pre ???????
  • ?????? pre->next ?? p->next???? p?
  • ??????? free ???? p?
  • ??

    ?????

    int main(){	cout << "??????????";	LinkedList list, start;	list = LinkedListCreatH();	for (start = list->next; start != NULL; start = start->next)	{		cout << start->data << endl;}

    ?????

    int main(){	cout << "??????????";	LinkedList list, start;	list = LinkedListCreatH();	for (start = list->next; start != NULL; start = start->next)	{		cout << start->data << endl;}

    ????

    int main(){	cout << "??????????";	LinkedList list, start;	list = LinkedListCreatH();	LinkedListInsert(list, 3, 5);	for (start = list->next; start != NULL; start = start->next)	{		cout << start->data << endl;}

    ????

    int main(){	cout << "??????????";	LinkedList list, start;	list = LinkedListCreatH();	LinkedListDelete(list, 3);	for (start = list->next; start != NULL; start = start->next)	{		cout << start->data << endl;}

    ??

    ?????????????????????????????????????????????????????????????????????????????????

    转载地址:http://rjjz.baihongyu.com/

    你可能感兴趣的文章
    pptp拨号上网
    查看>>
    ppt上的倒计时小工具_PPT中有哪些「看似很 LOW,实则惊艳」的小工具
    查看>>
    PPT添加视频的路径问题
    查看>>
    PPT美化插件 islide 安装过程问题“加载com加载项时运行出现错误”
    查看>>
    Prefix Tuning:详细解读Optimizing Continuous Prompts for Generation
    查看>>
    PreparedStatement 与Statement 的区别,以及为什么推荐使用 PreparedStatement ?
    查看>>
    PreparedStatement 查询 In 语句 setArray 等介绍。
    查看>>
    presentModalViewController显示半透明的一个view
    查看>>
    PresentViewController切换界面
    查看>>
    PyTorch之torch.utils.data.DataLoader解读
    查看>>
    PyTorch之DataLoader杂谈
    查看>>
    presto、druid、sparkSQL、kylin的对比分析
    查看>>
    Presto分布式大数据查询引擎
    查看>>
    Presto架构及原理
    查看>>
    Presto(一)集群部署
    查看>>
    Presto(二)开启安全认证
    查看>>
    Pricing procedure Steps and Details in SAP MM (from SCN)
    查看>>
    Prim 算法在不同权重范围内的性能分析及其实现
    查看>>
    Primace 5.0软件与KEIL单片机软件联合在线仿真步骤
    查看>>
    Prime Distance
    查看>>