随笔分类 - 数据结构
摘要：#include#include#include#includetypedef struct node{ int data; struct node *prior; struct node *next;}NODE,*PNODE,*LINKLIST;//初始化void init(LINKLIST *list){ *list = (PNODE)malloc(sizeof(NODE)); (*list)->prior=NULL;//前驱 (*list)->next=NULL;//后继}//插入 到第i个位置 i>=1void insert(LINKLIST lis...
阅读全文
摘要：#include#include#include#include//双向循环链表的结构体定义typedef struct node{ int data; struct node *prior; struct node *next;}NODE,*PNODE,*LINKLIST;//初始化void init(LINKLIST *list){ *list = (PNODE)malloc(sizeof(NODE)); (*list)->next = *list; (*list)->prior = *list;}//添加void add(LINKLIST list,i...
阅读全文
摘要：#include#include#include#includetypedef struct node{ int data; struct node *next;}NODE,*PNODE,*LINKLIST;//初始化void init(LINKLIST *list){ (*list) = (PNODE) malloc(sizeof(NODE)); (*list) ->next = *list;//头指针指向头结点}//添加数据,void add(LINKLIST list,int data){ PNODE p=list,q; //先将p移动到最后一个节点 ...
阅读全文
摘要：#include#include#include#includetypedef struct node{ int data; struct node *next;}NODE,HEAD,*PNODE,*LINKLIST;//初始化链表void init(LINKLIST *list){ *list = (LINKLIST)malloc(sizeof(HEAD)); (*list)->next=NULL;}//向链表添加数据void add(LINKLIST list,int data){ PNODE p = list ,q; if(!p) ret...
阅读全文
