From 27f930d328c9cf8466c2d41a34dc82d98ddf3ec6 Mon Sep 17 00:00:00 2001
From: ViolentAyang <76544389+ViolentAyang@users.noreply.github.com>
Date: Tue, 8 Mar 2022 19:39:27 +0800
Subject: [PATCH] =?UTF-8?q?Create=20=E5=B8=A6=E5=A4=B4=E7=BB=93=E7=82=B9?=
 =?UTF-8?q?=E5=8D=95=E9=93=BE=E8=A1=A8=E6=8C=89=E4=BD=8D=E5=BA=8F=E6=8F=92?=
 =?UTF-8?q?=E5=85=A5.c?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 链表/带头结点单链表按位序插入.c | 57 +++++++++++++++++++++++++++++++++
 1 file changed, 57 insertions(+)
 create mode 100644 链表/带头结点单链表按位序插入.c

diff --git a/链表/带头结点单链表按位序插入.c b/链表/带头结点单链表按位序插入.c
new file mode 100644
index 0000000..3e5726c
--- /dev/null
+++ b/链表/带头结点单链表按位序插入.c
@@ -0,0 +1,57 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<stdbool.h>
+
+typedef struct LNode{
+    int data;
+    struct LNode *next;
+}LNode,*LinkList;
+
+bool InitList(LinkList *L){
+	(*L) = (LNode*)malloc(sizeof(LNode));
+    if(L==NULL){
+        return false;
+    }
+	(*L)->next = NULL;
+    return true;
+}
+bool ListInsert(LinkList *L,int i,int e){
+    if(i<1){
+        return false;
+    }
+    LNode *p;
+    int j = 0;
+    p = *L;
+    while(p&&j<i-1){
+        p = p->next;
+        j ++;
+    }
+    if(p == NULL){
+        return false;
+    }
+    LNode *s = (LNode*)malloc(sizeof(LNode));
+    s->data = e;
+    s->next=p->next;
+    p->next=s;
+    return true;
+}
+void PrintList(LinkList L){
+    LinkList p = L->next;
+	while(p){
+        printf("%d\n",p->data);
+        p = p->next;
+    }
+}
+
+int main(){
+    LinkList L;
+    InitList(&L);
+    for(int j=0;j<10;j++){
+        ListInsert(&L,j+1,j);
+    }
+    PrintList(L);
+    printf("-------测试-------\n");
+  	ListInsert(&L,5,66); 
+    PrintList(L);
+    return 0;
+}