问移除链接结构的值

EN

#include<stdio.h>
#include<stdlib.h>
typedef struct cell *CellPtr;
typedef struct cell {
    int contents;
    CellPtr next;
}   Cell;
int search(int input, CellPtr list);
CellPtr delete_cell(int input, CellPtr list);
int main()
{
    CellPtr list;
    list = malloc(sizeof(Cell));
    list->contents = -2;                                /*ONLY FOR TESTING*/
    list->next = malloc(sizeof(Cell));
    list->next->contents = 4;
    list->next->next = malloc(sizeof(Cell));
    list->next->next->contents = -6;
    list->next->next->next = malloc(sizeof(Cell));
    list->next->next->next->contents = 100;
    printf("search(100, list) = %d\n", search(-6, list));
    if (list = delete_cell(-5, list) == NULL)
        printf("not found");
    return 0;
}

CellPtr delete_cell(int input, CellPtr list)
{
    int i, j;
    CellPtr p, q, tmp;
    if (i = search(input, list) == 0)   {
        return NULL;
    }
    p = list;
    if (i == 1) {
        list = p->next;
        free(p);
        return list;
    }
    for (j=1; j<i-1; j++)   {
        p = p->next;                            /*to get the address of the cell pointing to wanted cell*/
    }
    if (p->next->next == NULL)  {               /*wanted cell is the last one in the list*/
        free(p->next);
        p->next = NULL;
        return list;
    }
    q = p->next;
    while (q->next->next != NULL)   {           /*q is the address of the cell one before the last cell*/
        q = q->next;
    }
    if ((input * list->contents > 0) && (input * q->next->contents < 0))  {
        tmp = list;
        list = tmp->next;
        tmp->next = p->next->next;
        free(p->next);
        p->next = tmp;
        return list;
    }
    if ((input * list->contents <0) && (input * q->next->contents > 0)) {
        q->next->next = p->next->next;
        free(p->next);
        p->next = q->next;
        q->next = NULL;
        return list;
    }
    if ((input * list->contents >0) && (input * q->next->contents > 0)) {
        q->next->next = p->next->next;
        free(p->next);
        p->next = q->next;
        q->next = NULL;
        return list;
    }
    if ((input * list->contents <0) && (input * q->next->contents < 0)) {
        return NULL;
    }
}