SDUT 1138 数据结构上机测试2-1:单链表操作A

# include <stdio.h>
# include <malloc.h>

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

struct node *creat(int n)
{
    struct node *head, *tail, *p;
    head = (struct node *)malloc(sizeof(struct node));
    head -> next = NULL;
    tail = head;
    for(int i = 0; i < n; i++)
    {
        p = (struct node *)malloc(sizeof(struct node));
        scanf("%d", &p -> date);
        p -> next = NULL;
        tail -> next = p;
        tail = p;
    }
    return head;
}

void Delete(struct node *&head, int n, int m)
{
    struct node *p, *q;
    p = head;
    while(p -> next != NULL)
    {
        if(p -> next -> date == m)
        {
            n--;
            q = p -> next;
            p -> next = q -> next;
            free(q);
        }
        else
            p = p -> next;
    }
    printf("%d\n", n);
}

void output(struct node *head)
{
    struct node *r = head;
    while(r -> next -> next != NULL)
    {
        printf("%d ", r -> next -> date);
        r = r -> next;
    }
    printf("%d\n", r -> next -> date);
}

int main(void)
{
    int n, m;
    scanf("%d", &n);
    struct node *head;
    head = creat(n);
    scanf("%d", &m);
    printf("%d\n", n);
    output(head);
    Delete(head, n, m);
    output(head);

    return 0;
}

 

 

/**************************************
 Problem id : SDUT OJ 1138
 User name : Silence—Debug
 Result  : Accepted
 Take Memory : 280K
 Take Time : 0MS
 Submit Time : 2013-03-16 12:51:59 
**************************************/