单链表查找中间元素

int ListLinkSearch(Node *head)
{
    if(head == NULL)
    {
        return FAILURE;
    }

    Node *current = head->next;
    Node *middle = head->next;

    int i = j = 0;
    while(current != NULL)
    {
        if(i/2 > j)
        {
            j++;
            current = current->next;
        }
        i++;
        middle = middle->next;
    }
    return SUCCESS;
}