关注公众号程序猿从入门到入土查询更方便哦

编写算法建立的链表，实现将其分解成两个链表，其中一个全部为奇数，另一个全部为偶数（尽量利用已知存储空间）

#include<bits/stdc++.h>
#define RESULT int
#define OK 1
#define ERROR 0

using namespace std;

typedef struct Node {

    int data;
	Node* front;
	Node* next;

}LNode, * LinkList;

RESULT InitList(LinkList& L);									//初始化链表
RESULT InsertData_Back(LinkList& L, int data);					//尾插
RESULT InsertData_Sort(LinkList& L, int data);					//尾插
RESULT Output_LinkList(LinkList& L);							//打印链表

int main() {

	LinkList l = new LNode;
	InitList(l);

	int n;
	cin >> n;
	int i = 0;
	while (n != 0) {
		InsertData_Back(l, n);
		cin >> n;
		i++;
	}

	LinkList s = new LNode;
	InitList(s);
	LinkList temp;
	LinkList sp = s;
	LinkList p = l->next;
	for (int j = 0; j < i && p != NULL; j++) {
		if (p->data % 2 == 0) {
			if (p->next == NULL) {
				p->front->next = NULL;
				sp->next = p;
				break;
			}
			p->front->next = p->next;	//取下节点
			p->next->front = p->front;
			sp->next = p;
			p->front = sp;
			temp = p->next;
			p->next = NULL;
			p = temp;
			sp = sp->next;

		}
		else {
			p = p->next;

		}
	}

	Output_LinkList(l);
	Output_LinkList(s);
	return 0;
}

RESULT InitList(LinkList& L) {

	L = new LNode;
	L->next = NULL;

	return OK;
}


RESULT InsertData_Back(LinkList& L, int data) {

	LinkList temp = new LNode;
	temp->data = data;
	temp->next = NULL;
	LinkList p = L;
	while (p->next != NULL) {
		p = p->next;
	}
	temp->front = p;
	p->next = temp;

	return OK;
}

RESULT InsertData_Sort(LinkList& L, int data) {
	LinkList p = L;
	while (p->next != NULL && data > p->next->data) {
		p = p->next;
	}
	if (p->next == NULL) {
		InsertData_Back(L, data);
	}
	else {
		LinkList temp = new LNode;
		temp->data = data;
		temp->next = p->next;
		p->next = temp;
	}
	return 0;
}


RESULT Output_LinkList(LinkList& L) {

	LinkList temp = L->next;

	while (temp != NULL) {
		cout << temp->data << " ";
		temp = temp->next;
	}
	printf("\n");

	return OK;
}