#include <bits/stdc++.h>
using namespace std;
typedef struct Node
{
    int elem;
    struct  Node *next;
}*Linklist;
void inlinklist(Linklist &l, int n)
{
    l = (Linklist)malloc(sizeof(Node));
    l->next = NULL;
    Linklist p, END;//定义尾部节点
    END = l;
    printf("请输入想要创建的链表元素:\n");
    for(int i = 0; i < n; i++)
    {
        p = (Linklist)malloc(sizeof(Node));
        scanf("%d", &p->elem);
        END -> next = p;
        p->next = NULL;
        END = p;
    }
}
void outlinklist(Linklist l)
{
    printf("链表中的值为:\n");
    Linklist  p;
    p = l->next;
    while(p != NULL)
    {
        printf("%d ", p->elem);
        p = p->next;
    }
    printf("\n");
}
void splitlinklist(Linklist &l1, Linklist &l2, Linklist &l3)
{
    l2 = (Linklist)malloc(sizeof(Linklist));
    l3 = (Linklist)malloc(sizeof(Linklist));
    Linklist p, q, s;
    p = l1;
    q = l2;
    s = l3;
    p = l1 -> next;
    q -> next = s -> next = NULL;
    while(p)
    {
        if(p->elem % 2 == 1)
        {
            q -> next = p;
            //printf("q的元素值:%d\n", q -> elem);
            p = p -> next;
            q = q -> next;
            q -> next = NULL;
        }
        else if(p->elem % 2 == 0)
        {
            s -> next = p;
            //printf("s的元素值:%d\n", s -> elem);
            p = p -> next;
            s = s -> next;
            s -> next = NULL;
        }
    }
}
int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    Linklist L1, L2, L3;
    int n;
    printf("请输入创建n个元素的链表的n值:\n");
    scanf("%d", &n);
    inlinklist(L1, n);
    splitlinklist(L1, L2, L3);
    outlinklist(L2);
    outlinklist(L3);
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 10;
typedef struct node
{
    int *arr;
    int length;
    int maxsize;
}sqlist;
void createsqlist(sqlist &l)
{
    l.arr = (int*)malloc(maxn * sizeof(int));
    l.length = 0;
    l.maxsize = maxn;
}
void insqlist(sqlist &l, int n)
{
    int *p;
    printf("请依次输入数字来创建顺序表:\n");
    for(p = l.arr; p < l.arr + n; p++)
    {
        scanf("%d", p);
    }
    l.length = n;
}
void outsqlist(sqlist l)
{
    int *p;
    printf("顺序表的元素为:\n");
    for(p = l.arr; p < l.arr + l.length; p++)
        printf("%d ", *p);
}
void deletesqlist(sqlist &l, int elem)
{
    int i = 0;
    while(i < l.length && l.arr[i] != elem)
        i++;
    for(int j = i + 1; j < l.length; j++)
    {
        if(l.arr[j] != elem)
        {
            l.arr[i++] = l.arr[j];
        }
    }
    l.length = i;
}

int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, elem;
    sqlist L;
    createsqlist(L);
    printf("请输入n个元素:\n");
    scanf("%d", &n);
    insqlist(L, n);
    printf("请输入删除的元素值:\n");
    scanf("%d", &elem);
    deletesqlist(L, elem);
    outsqlist(L);
    return 0;
}