![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
链表
NJNUqhx
大一新生,努力学习ing
展开
-
双链表基本操作
#include<stdio.h> #include<stdlib.h> struct Node { int value; struct Node *prior; struct Node *next; } ; typedef struct Node node; void menu(void) { printf("you must initialize first!!!\n"); printf("menu:\n"); pri...原创 2020-12-29 20:24:00 · 158 阅读 · 0 评论 -
合并k个升序链表(分治策略)
/** *Definitionforsingly-linkedlist. *structListNode{ *intval; *structListNode*next; *}; */ #include<stdlib.h> structListNode*merge(structListNode*h1,structListNode*h2) { structListNode*head,*temp,*p=h1,*...原创 2020-12-26 16:43:14 · 155 阅读 · 0 评论 -
用堆栈实现链表反转
/** *Definitionforsingly-linkedlist. *structListNode{ *intval; *structListNode*next; *}; */ structstack { structListNode*code; structstack*next; }; voidpush(structstack**top,structListNode*newcode...原创 2020-12-25 22:41:56 · 295 阅读 · 0 评论