蔡子经数据结构1.19

#include <stdlib.h>

typedef struct 
{
    int val;
    struct * next;
} node;

node* createNode()
{
    node *ret = (node*)malloc(sizeof(node));
    ret->val = 0;
    ret->next = NULL;
    return ret;
}


void print(node *head)
{
    node *p = head->next;
    while(p != head)
    {
        printf("%d ",p->val);
        p = p->next;
    }
    puts("");
    return ;
}

node *modify(node *p)
{
    node *head = createNode();
    head->next = p;
    node *temp = head;
    int cnt = 0;
    while(temp->next)
    {
        ++cnt;
        temp = temp->next;
    }
    temp->next = head;
    head->val = cnt;
    return head;
}

int main()
{
    node *p = NULL, *rec = NULL;
    for(int i = 0; i < 10; ++i)
    {
        if(p == NULL)
        {
            p = createNode();
            p->val = i+1;
            rec = p;
        }
        else
        {
            p->next = createNode();
            p = p->next;
            p->val = i+1;
        }
    }
    p = rec;
    node *head = modify(p);
    print(head);
    return 0;
}