单链表的中间元素

node *search(node *head){    int i = 0;    int j = 0;    node *current = NULL;    node *middle = NULL;    current = middle = head->next;    while(current!=NULL)    {        if(i/2>j)        {            j++;            middle = middle->next;        ]        i++;        current=current->next;    }    return middle;}