diff --git "a/2224020144/\347\254\2549\347\253\240/\345\223\210\345\270\214\350\241\250.cpp" "b/2224020144/\347\254\2549\347\253\240/\345\223\210\345\270\214\350\241\250.cpp"
new file mode 100644
index 0000000000000000000000000000000000000000..6d2afa9150a124b69ab8bf4a93f7e83c927a8105
--- /dev/null
+++ "b/2224020144/\347\254\2549\347\253\240/\345\223\210\345\270\214\350\241\250.cpp"
@@ -0,0 +1,67 @@
+#include<stdio.h>
+#define MaxSize 1005
+int ht[MaxSize];
+int a[MaxSize];
+int n;
+void insertht(int x,int no)
+{
+	ht[x]=no;
+}
+void deleteht(int x)
+{
+	ht[x]=-1;
+}
+void dispa()
+{
+	printf("a:");
+	for(int i=0;i<n;i++)
+		printf("%d",a[i]);
+	printf("\n"); 
+}
+void inserta(int x)
+{
+	a[n]=x;
+	insertht(x,n);
+	n++;
+}
+void deletea(int x)
+{
+	int no=ht[x];
+	deleteht(x);
+	a[no]=a[n-1];
+	deleteht(a[n-1]);
+	insertht(a[n-1],no);
+	n--;
+}
+int search(int no)
+{
+	return a[no-1];
+}
+int main()
+{
+	int op[]={1,5,1,4,1,3,2,4,1,7,1,6,3,2,2,5,3,1,3,2};
+	int m=sizeof(op)/sizeof(op[0]);
+	for(int i=0;i<MaxSize;i++)
+		ht[i]=-1;
+	n=0;
+	for(int i=0;i<m;i+=2)
+	{
+		switch(op[i])
+		{
+		case 1:
+			printf("插入%d\t\t",op[i+1]);
+			inserta(op[i+1]);
+			dispa();
+			break;
+		case 2:
+			printf("删除%d\t\t",op[i+1]);
+			deletea(op[i+1]);
+			dispa();
+			break;
+		case 3:
+			printf("序号%d的整数:%d\n",op[i+1],search(op[i+1]));
+			break;
+		}
+	}
+	return 1;
+}
\ No newline at end of file