//循环链表#include#includetypedef struct Node{int data; struct Node* next;}Node,*LinkList;void InitList(LinkList* L){(*L) = (LinkList)malloc(sizeof(Node));(*L)->next = (*L);//(*
数据结构中约瑟夫环
带头结点的单链表转置
//多项式加法#include#includetypedef struct PloyNode{ int cofe; int exp; struct PloyNode* next;}PloyNode,*PloyList;void InitPloy(PloyList* p){ (*p) = (PloyNode*)malloc(sizeof(P
//求单链表中的倒数第K个节点#include#includetypedef struct _Node{ int val; struct _Node* next;}Node,*LinkList;//带头结点的单链表#if 0void InitList(LinkList* list){ (*list) = (Node*)malloc(sizeof(Node)); (*lis
#include#include//删除单链表中的任意一个节点，可能是传节点删除，也可能是传节点的值删除typedef struct _Node{ int val; struct _Node* next;}Node,*LinkList;//不带头结点的单链表void Init(LinkList* list){ (*list) = NULL;}void Creat(Link
//不带头结点的单链表#include#include//链表结构体typedef struct _Node{ int val; struct _Node* next;}Node,*LinkList;void InitList(LinkList* list){ *list = NULL;}void InsertHeadList(LinkList* list){ int
//单链表 //带头结点的单链表 #include #include //单链表的结构体 typedef struct _Node{ int data; struct _Node* next;}Node, *LinkList;void Init(LinkList* list){ (*list) = (Node*)malloc(sizeof(Node)); (*l
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号
