typedef struct Node
{
  int data;
  struct Node* next;
}node, *pLinkedList;

Node* removeMidNode(pLinkedList head)
{
  if (head->next == NULL || head == NULL)
    return head;
  if (head->next->next == NULL)
    return head->next;
  pLinkedList fast = head;
  pLinkedList slow = head;
  pLinkedList pre = NULL;
  /*
  head  1    2    3    4    5
  pre   slow  fast
  */
  //1個(gè)節(jié)點(diǎn)
  if (head->next->next == NULL)
    return head->next;
  while (fast->next != NULL && fast->next->next != NULL)
  {
    pre = slow;
    fast = fast->next->next;
    slow = slow->next;
  }
  //此時(shí)fast已到終點(diǎn)，slow為中間節(jié)點(diǎn)，pre為中間節(jié)點(diǎn)前一個(gè)節(jié)點(diǎn)
  pre->next = slow->next;
  free(slow);
  slow = NULL;
  return head;
}