#include <stdio.h> #include <stdlib.h> struct Node //结构体 { int data; //数据域 struct Node *next; //指针域 }; //申请头指针 struct Node* createList() { struct Node* headNode = (struct Node*)malloc(sizeof(struct Node)); //结构体指针申请动态空间,结构体指针变为结构体变量 headNode->next = NULL; return headNode; } 申请节点 struct Node* createNode(int data) { struct Node* newNode = (struct Node*)malloc(sizeof(struct Node)); newNode->data = data; //为节点加一个数据域 newNode->next = NULL; return newNode; } //头插法 void insertNodebyHead(struct Node* headList, int data) { struct Node *newNode = createNode(data); newNode->next = headList->next; headList->next = newNode; } //尾插法 void insertNodebyRear(struct Node* headList, int data) { struct Node *newNode = createNode(data); while(headList->next) { headList = headList->next; } newNode->next = NULL; headList->next = newNode; } void printNode(struct Node* HeadNode) { struct Node* pMove = HeadNode->next; while(pMove) { printf("node data is: %d\n", pMove->data); pMove = pMove->next; } } void deleteNodebyAppoint(struct Node* HeadNode, int data) { struct Node* postNodeFront = HeadNode; struct Node* postNode = HeadNode->next; while(postNode->data != data) { postNodeFront = postNode; postNode = postNodeFront->next; if(postNode == NULL) { printf("not find data\n"); return; } } postNodeFront->next = postNode->next; free(postNode); } int main() { /* Write C code in this online editor and run it. */ printf("Hello, World! \n"); struct Node* list = createList(); insertNodebyRear(list, 1); insertNodebyRear(list, 2); insertNodebyRear(list, 3); insertNodebyRear(list, 4); printNode(list); deleteNodebyAppoint(list,5); deleteNodebyAppoint(list, 3); printNode(list); return 0; }
0.0分
0 人评分
C语言训练-计算1~N之间所有奇数之和 (C语言代码)浏览:720 |
C语言程序设计教程(第三版)课后习题9.3 (Java代码)浏览:965 |
C语言程序设计教程(第三版)课后习题11.5 (C语言代码)浏览:901 |
printf基础练习2 (C语言代码)浏览:942 |
求组合数 (C语言代码)浏览:1159 |
C语言程序设计教程(第三版)课后习题6.2 (C语言代码)浏览:711 |
C语言程序设计教程(第三版)课后习题9.1 (C语言代码)浏览:681 |
程序员的表白 (C语言代码)浏览:598 |
图形输出 (C语言代码)浏览:944 |
C语言程序设计教程(第三版)课后习题6.10 (C语言代码)浏览:512 |