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

bool isHuiWen(pLinkedList head)
{
  if (head == NULL || head->next == NULL)
    return true;
  pLinkedList right = head->next;//保存中間節(jié)點的下一個節(jié)點(若為偶數則為偏右的中間節(jié)點)
  pLinkedList cur = head;      //快指針
  while (cur->next != NULL && cur->next->next != NULL)
  {
    right = right->next;
    cur = cur->next->next;
  }
  //當鏈表總結點個數為奇數情況時：
  if (cur->next != NULL && cur->next->next == NULL)
    right = right->next;
  //將鏈表右邊的節(jié)點放入一個棧中
  stack<pLinkedList>* s = new stack<pLinkedList>();
  while (right != NULL)
  {
    s->push(right);
    right = right->next;
  }
  //比較鏈表左右兩邊節(jié)點是否相等
  while (!s->empty())
  {
    if (head->next->data != s->top()->data)
      return false;
    s->pop();
    head = head->next;
  }
  return true;
}