#include <stdio.h>#include <stdlib.h>#define TRUE 1#define FALSE 0//指针fwd指向前一个节点，bwd指向后一个节点typedef struct NODE {    struct NODE *fwd;    struct NODE *bwd;    int value;} Node;/*传入指向 头部和尾部节点的指针 的指针，四种情况 * 插入到表头， * 插入到表尾， * 插入到空表中， * 插入到表中，前三个都需要修改headPtr或tailPtr指针 */int doubleLinklistInsert(Node **headPtr, Node **tailPtr, int value){    Node *this = *headPtr;    Node *newNode;    while( this != NULL && this -> value < value){        this = this -> fwd;    }    newNode = (Node *)malloc(sizeof(Node));    newNode -> value = http://www.mamicode.com/value;"%d\t", rootPtr -> value);        rootPtr = rootPtr -> fwd;    }    return 0;}

#include <stdio.h>#include <stdlib.h>#define TRUE 1#define FALSE 0typedef struct Node {    struct Node *next;    int value;} Linklist;Linklist *sll_reverse(Linklist *first){    if(first == NULL){        return  NULL;    }    Linklist *current = first;    Linklist *next;    Linklist *pre;    Linklist *morePre = NULL;    while((next = current -> next) != NULL){        //循环移动当前指向的节点        pre = current;        current = next;        //修改前一节点的next指针为前前节点        pre -> next = morePre;        //移动前前节点morePre的指针        morePre = pre;    }    //如果为单个节点之间返回    if(current == first){        return  first;    }else{    //修改最后一个节点的指针，作为头指针返回原来的最后一个节点的位置        current -> next = pre;        return current;    }}int main(){    Linklist third = {NULL, 4};    Linklist second = {&third, 3};    Linklist first = {&second, 2};    Linklist *head = &first;    head = sll_reverse(head);    while (head != NULL){        printf("%d\t", head -> value);        head = head -> next;    }    return 0;}

#include <stdio.h>#include <stdlib.h>#define TRUE 1#define FALSE 0typedef struct Node {    struct Node *next;    int value;} Linklist;//从first指向的链表中删除节点nodeint sll_delete(Linklist **first, Linklist *node){    Linklist **ptr = first;    //Ptr为指向 next字段的 指针    while(*ptr != NULL && *ptr != node){        ptr = &((*ptr) -> next);    }    //如果没有找到    if(*ptr == NULL){        return FALSE;    }else{    //如果找到了，变更前节点指向        *ptr = (*ptr) -> next;    //释放节点内存        free(*ptr);
　　　　　return FALSE;    }}int main(){    Linklist third = {NULL, 3};    Linklist second = {&third, 2};    Linklist first = {&second, 1};    Linklist *headPtr = &first;    Linklist *head = headPtr;    while (head != NULL){        printf("%d\t", head -> value);        head = head -> next;    }    printf("\n");    sll_delete(&headPtr, &second);    head = headPtr;    while (head != NULL){        printf("%d\t", head -> value);        head = head -> next;    }    printf("\n");    sll_delete(&headPtr, &first);    head = headPtr;    while (head != NULL){        printf("%d\t", head -> value);        head = head -> next;    }    printf("\n");    sll_delete(&headPtr, &third);    head = headPtr;    while (head != NULL){        printf("%d\t", head -> value);        head = head -> next;    }    return 0;}

#include <stdio.h>#include <stdlib.h>#define TRUE 1#define FALSE 0typedef struct Node {    struct Node *next;    int value;} Linklist;//从first指向的链表中删除节点nodeint sll_delete(Linklist *first, Linklist *node){    Linklist *pre = NULL;    Linklist *cur = first;    while(cur != NULL && cur != node){        pre = cur;        cur = cur -> next;    }    //如果没有找到    if(cur == NULL){        return FALSE;    }else if(cur == first){        //此时first是传值传入，只可以修改头指针指向的值，修改为第二个节点        *first = *(cur -> next);        free(node);        return TRUE;    }else{        pre -> next = cur -> next;        free(node);        return TRUE;    }}int main(){    Linklist third = {NULL, 3};    Linklist second = {&third, 2};    Linklist first = {&second, 1};    Linklist *headPtr = &first;    Linklist *head = headPtr;    while (head != NULL){        printf("%d\t", head -> value);        head = head -> next;    }    printf("\n");    sll_delete(headPtr, &second);    head = headPtr;    while (head != NULL){        printf("%d\t", head -> value);        head = head -> next;    }    printf("\n");    sll_delete(headPtr, &first);    while (headPtr != NULL){        printf("%d\t", headPtr -> value);        headPtr = headPtr -> next;    }    printf("\n");    sll_delete(headPtr, &third);    head = headPtr;    while (head != NULL){        printf("%d\t", head -> value);        head = head -> next;    }    printf("\n");    return 0;}