int data;struct node *next;}Node, *LinkedList;Node* Locate(LinkedList first, int i) { Node *p = first;int j = 1;if(i = 0) return NULL;while(p i) { p = p-next;j++;} return p;}
LNode *ra = A, *rb = B; //ra和rb将分别指向将创建的A表和B表的尾结点 p = A->next; //p为链表工作指针,指向待分解的结点 A->next = NULL; //置空新的A表 while (p != NULL) { i++; //序号加1 if (i % 2 == 0) //处理序号为偶数的链表结点 { rb->next = p; //在B表...