From cc2648cf1e07a0d1d45339a8688ff165a7e27c0c Mon Sep 17 00:00:00 2001
From: ViolentAyang <76544389+ViolentAyang@users.noreply.github.com>
Date: Sun, 6 Mar 2022 16:29:13 +0800
Subject: [PATCH] =?UTF-8?q?Create=20=E5=8A=A8=E6=80=81=E7=BA=BF=E6=80=A7?=
 =?UTF-8?q?=E8=A1=A8=E5=AE=89=E6=8C=89=E4=BD=8D=E6=9F=A5=E6=89=BE.c?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 线性表/动态线性表安按位查找.c | 54 +++++++++++++++++++++++++++++++++++
 1 file changed, 54 insertions(+)
 create mode 100644 线性表/动态线性表安按位查找.c

diff --git a/线性表/动态线性表安按位查找.c b/线性表/动态线性表安按位查找.c
new file mode 100644
index 0000000..2013a81
--- /dev/null
+++ b/线性表/动态线性表安按位查找.c
@@ -0,0 +1,54 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<stdbool.h>
+#define InitSize 10
+
+typedef struct{
+	int *data;
+    int MaxSize;
+    int length;
+}SeqList;
+
+void InitList(SeqList *L){
+	L->data = (int*)malloc(sizeof(int)*InitSize);
+    for(int i = 0;i < InitSize;i ++){
+        L->data[i] = 0;
+    }
+    L->MaxSize = InitSize;
+    L->length = 0;
+}
+
+int GetElement(SeqList L,int i){
+    return L.data[i-1];
+}
+
+bool InsertList(SeqList *L,int i,int e){
+    if(i<1||i>L->length+1){
+        return false;
+    }
+	if(L->length>=L->MaxSize){
+        return false;
+    }
+    for(int j = L->length;j>=i;j--){
+        L->data[j] = L->data[j-1];
+    }
+    L->data[i-1] = e;
+    L->length++;
+    return true;
+}
+void PrintList(SeqList L){
+    for(int i = 0;i < L.length;i ++){
+        printf("%d\n",L.data[i]);
+    }
+}
+
+int main(){
+	SeqList L;
+    InitList(&L);
+    for(int i = 1;i < 10;i ++){
+        InsertList(&L,i,i-1);
+    }
+    PrintList(L);
+    printf("查找到的结果为%d",GetElement(L,6));
+    return 0;
+}