数据结构之 线性表---单链表的拆分

#include <iostream>
#include <string>
#include <cstdio>
#include <string.h>
#include <algorithm>
#include <ctype.h>

using namespace std;

struct node
{
    int data;
    struct node *next;
};

struct node *creat(int n)
{
    int i;
    struct node *head, *tail, *p;
    head=new node;
    head->next=NULL;
    tail=head;

    for(i=0; i<n; i++)
    {
        p=new node;
        cin>>p->data;
        p->next=NULL;
        tail->next=p;
        tail=p;
    }
    return head;
}

int main()
{
    int n;
    int len1, len2;
    int i, j;
    cin>>n;
    struct node *head, *w, *h1, *t1, *h2, *t2;

    head = creat(n);
    len1=0;
    len2=0;

    w=head->next;
    delete head;

    h1=new node; h1->next=NULL; t1=h1;
    h2=new node; h2->next=NULL; t2=h2;

    for(i=0; i<n; i++)
    {
        if( w->data%2==0 )
        {
            t1->next=w;
            t1=t1->next;

            w=w->next;
            len1++;
        }
        else
        {
            t2->next=w;
            t2=t2->next;

            w=w->next;
            len2++;
        }
    }
    cout<<len1<<‘ ‘<<len2<<endl;

    w=h1->next;
    delete h1;
    for(j=0; j<len1; j++)
    {
        if(j==0)
          cout<<w->data;
        else
          cout<<" "<<w->data;
        w=w->next;
    }
    cout<<endl;

    w=h2->next;
    delete h2;
    for(j=0; j<len2; j++)
    {
        if(j==0)
          cout<<w->data;
        else
          cout<<" "<<w->data;
        w=w->next;
    }
    cout<<endl;

    return 0;
}