typedef struct LNode {
int val;
LNode *nxt;
LNode(int _val, LNode *_l) : val(_val), nxt(_l) {}
} LNode;
LNode *Troot, *odd, *even;
inline void div(LNode *root) {
odd = NULL;
even = NULL;
while (root != NULL) {
if (root -> val & 1) {
if (odd == NULL) odd = new LNode(root -> val, NULL);
else {
LNode *p = new LNode(root -> val, odd);
odd = p;
}
} else {
if (even == NULL) even = new LNode(root -> val, NULL);
else {
LNode *p = new LNode(root -> val, even);
even = p;
}
}
root = root -> nxt;
}
}
将不带表头节点的单链表按奇偶拆成两个表
最新推荐文章于 2023-09-07 23:33:30 发布