博客
关于我
数据结构 链表【单向链表的初始化,头插法建立,尾插法建立,插入,删除】
阅读量: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/

    你可能感兴趣的文章
    Objective-C实现MAC桌面暗水印(附完整源码)
    查看>>
    Objective-C实现mandelbrot曼德勃罗特集算法(附完整源码)
    查看>>
    Objective-C实现markov chain马尔可夫链算法(附完整源码)
    查看>>
    Objective-C实现MATLAB中Filter函数功能(附完整源码)
    查看>>
    Objective-C实现matrix chainorder矩阵链顺序算法(附完整源码)
    查看>>
    Objective-C实现matrix exponentiation矩阵求幂算法(附完整源码)
    查看>>
    Objective-C实现MatrixMultiplication矩阵乘法算法 (附完整源码)
    查看>>
    Objective-C实现max non adjacent sum最大非相邻和算法(附完整源码)
    查看>>
    Objective-C实现max subarray sum最大子数组和算法(附完整源码)
    查看>>
    Objective-C实现max sum sliding window最大和滑动窗口算法(附完整源码)
    查看>>
    Objective-C实现MaxHeap最大堆算法(附完整源码)
    查看>>
    Objective-C实现MaximumSubarray最大子阵列(Brute Force蛮力解决方案)算法(附完整源码)
    查看>>
    Objective-C实现MaximumSubarray最大子阵列(动态规划解决方案)算法(附完整源码)
    查看>>
    Objective-C实现maxpooling计算(附完整源码)
    查看>>
    Objective-C实现max_difference_pair最大差异对算法(附完整源码)
    查看>>
    Objective-C实现max_heap最大堆算法(附完整源码)
    查看>>
    Objective-C实现MD5 (附完整源码)
    查看>>
    Objective-C实现md5算法(附完整源码)
    查看>>
    Objective-C实现MeanSquareError均方误差算法 (附完整源码)
    查看>>
    Objective-C实现median filter中值滤波器算法(附完整源码)
    查看>>