循环链表拆分【C语言】

循环链表拆分【C语言】

题目:

将一个循环链表表示的稀疏多项式分解成两个多项式，使得这两个多项式中各自仅含奇数项或者偶数项

时间复杂度任意	空间复杂度为O(1)

代码:

/*1-9*/
#include <stdio.h>
#include <stdlib.h>
#define elemtype int
int num=0;
typedef struct cNode
{
    elemtype data1;/*单项式的系数*/
    elemtype data2;/*单项式的指数*/
    struct cNode *next;
}cNode;
typedef cNode* Circlelist;
void Initlist(Circlelist *L)
{
    *L=(Circlelist)malloc(sizeof(cNode));
    (*L)->next=*L;/*建立空的循环单链表*/
}
void CreateFromTail(Circlelist L)
{
    int i=0;
    cNode *r,*s;
    r=L;
    elemtype a,b;
    while(i!=num)
    {
        scanf("%d%d",&a,&b);
        s=(cNode*)malloc(sizeof(cNode));
        s->data1=a;
        s->data2=b;
        r->next=s;
        r=s;
        i++;
    }
    r->next=L;
}
void CreateFromHead(Circlelist L)
{
    int i=0;
    cNode *s;
    elemtype a,b;
    while(i!=num)
    {
        scanf("%d%d",&a,&b);
        s=(cNode*)malloc(sizeof(cNode));
        s->data1=a;
        s->data2=b;
        s->next=L->next;
        L->next=s;
        i++;
    }
}
void Divide(Circlelist L)
{
    cNode *q,*p,*rear;
    int i=0;
    rear=L;q=L->next;p=L;
    while(rear->next!=L)
    {
        rear=rear->next;
        if(rear->data2%2==0)
        {
            i++;
        }
    }
    while(i!=0)
    {
        if(q->data2%2==0)
        {
            p->next=q->next;
            q->next=L;
            rear->next=q;
            rear=q;
            q=p->next;
            i--;
        }
        else
        {
            p=p->next;
            q=p->next;
        }
    }}
void view(Circlelist L)
{
    cNode *p;
    p=L->next;
    printf("奇数次多项式为：\n");
    int flog=0;
    while((p->data2)%2!=0)
    {
        if(flog==0)
        {
            printf("%dx^%d",p->data1,p->data2);
        }
        else
        {
            printf("+%dx^%d",p->data1,p->data2);
        }
        p=p->next;
        flog++;
    }
    printf("\n");
    printf("偶数次多项式为：\n");
    while(p!=L)
    {
        printf("%dx^%d",p->data1,p->data2);
        if(p->next!=L)
        {
            printf("+");
        }
        p=p->next;
    }
    printf("\n");
}
int main()
{
    Circlelist L;
    Initlist(&L);
    printf("请您输入--多项式的总个数：\n");
    scanf("%d",&num);
    printf("若使用头插法请输入--'H'\n");
    printf("若使用尾插法请输入--‘T’\n");
    char I;scanf("%s",&I);
    printf("请您依次输入每个单项式的系数、指数：\n");
    if(I=='H')
    {
        CreateFromHead(L);
    }
    else
    {
        CreateFromTail(L);
    }
    Divide(L);
    view(L);
    printf("Hello World!\n");
    return 0;
}

---

运行情况:

请您输入--多项式的总个数：
5
若使用头插法请输入--'H'
若使用尾插法请输入--‘T’
T
请您依次输入每个单项式的系数、指数：
1 1 2 2 3 3 4 4 5 5
奇数次多项式为：
1x^1+3x^3+5x^5
偶数次多项式为：
2x^2+4x^4
Hello World!
Program ended with exit code: 0

Copyright © 2019 wyq. All rights reserved.