Create 求带头结点的单链表长度.c

链表/求带头结点的单链表长度.c

@@ -0,0 +1,66 @@
+#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;
+}
+
+int Length(LinkList L){
+	int len = 0;
+	LNode *p = L;
+	while(p->next!=NULL){
+		p = p->next;
+		len++;
+	}
+	return len;
+}
+
+bool InsertList(LinkList *L,int i,int e){
+	if(i<1){
+		return false;
+	}
+	LNode *p;
+	p = *L;
+	int j = 0;
+	while(p&&j<i-1){
+		p = p->next;
+		j++;
+	}
+	if(!p){
+		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 i = 0;i < 10;i ++){
+    	InsertList(&L,i+1,i);
+    }
+    PrintList(L);
+    printf("----测试----\n");
+    printf("链表的长度为%d",Length(L));
+    return 0;
+}