loveDiane的博客

bool Push(ElementType X, Deque D) //将元素X插入到双端队列D的头； { if ((D->Rear + 1) % D->MaxSize == D->Front) return false; if (D->Front == D->Rear) { D->Data[D->Front] = X; D->Rear = (D->Rear + 1) %

ElementType Find(List L, int m) { int sumnumber = 0,temp=0,sum=0; List P; P = L->Next; while (P != NULL) { sumnumber++; P = P->Next; } P = L->Next; temp = sumnumber - m + 1; while (P != NULL)

List Merge(List L1, List L2) { List P, searchP1, searchP2, searchP3; P = (List)malloc(sizeof(List)); P->Next = NULL; searchP1 = L1->Next; searchP2 = L2->Next; searchP3 = P; while (searchP1 != NULL && searchP2 != NULL) { if (searc