链表的创建 求两个链表的交并差.docVIP

链表的创建 求两个链表的交并差 #include iostream using namespace std; #define ILLEGAL_PARAM 1 #define ILLEGAL_POSITION 2 typedef struct Node { int value; Node *next; Node() { value = 0; next = NULL; } }* LinkList; void createLinkList(LinkList list, int num); //void addNode(int num = 1); void listTraverse(LinkList list); int getElem(LinkList list, int locate); int locateElem(LinkList list, int elem); void listInsert(LinkList list, int locate, int elem); void listDelete(LinkList list, int locate); void mergeLinkList(LinkList list_a, LinkList list_b, LinkList list_c); void mergeLinkListIndependent(LinkList list_a, LinkList list_b, LinkList list_c); void unionList(LinkList list_a, LinkList list_b); void intersection(LinkList list_a, LinkList list_b); void except(LinkList list_a, LinkList list_b); void createLinkList(LinkList list, int num) { Node* node = new Node; node-value = 0; node-next = NULL; list = node; Node *new_node,*cur_node = node; for(int i = 0; i num; ++i) { new_node = new Node; cinnew_node-value; cur_node-next = new_node; cur_node = new_node; list-value++; } } int getElem(LinkList list, int locate) { if((locate 1)||(locate list-value)) exit(ILLEGAL_POSITION); Node *index = list-next; for(int i = 1; (i locate)(index); ++i) index = index-next; return index-value; } int locateElem(LinkList list, int elem) { LinkList p = list-next; int locate = 0; while(p) { ++locate; if(p-value == elem) break; p = p-next; } if(p) return locate; return 0; } void listInsert(LinkList list, int locate, int elem) { if((locate 1)||(locate list-value + 1)) exit(ILLEGAL_POSITION); Node *index = list; int i = 1; while(index(i locate)) { index = index-next; ++i; } Node *new_node = new Node; new_node-value = elem; new_node-next = index-next; index-next = new_node; list-value++; } void listDelete(LinkList list, int locate) { if((locate 1)||(locate list-value)) exit(ILLEGAL_POSITION); Node *index = list; int i = 1; whil