北京工业大学 数据结构与算法 （电控学院） 第二章线性表实验 顺序表 链表 约瑟夫环

#include<stdio.h> #include<stdlib.h> #include"linkedlist.h" main() { LinkedList *L; L=(LinkedList*)malloc(sizeof(LinkedList)); InitLinkedList(L); CreateLinkedList(L); TraverseLinkedList(L); int i; ElemType e; printf("input the location and the element you wanna insert:\n"); scanf("%d %d",&i,&e); InsertLinkedList(L,i,e); TraverseLinkedList(L); printf("input the location of the element you wanna delete:\n"); scanf("%d",&i); DeleteLinkedList(L,i); TraverseLinkedList(L); printf("input the element you wanna locate:\n"); scanf("%d",&e); printf("\nlocation: %d\n\n",LocateElem(L,e)); printf("input the location of the element you wanna get:\n"); scanf("%d",&i); printf("\nelement: %d\n\n",GetElem(L,i)); printf("thanks for examing\n\npress any key to exit\n"); getch(); }