int D_C(LinkList &L,int n)//数组栈-顺序栈和单链表的结合使用
{
	cin >> n;
	char s[n/2];
	LinkList p = L->next;
	int i = 0;
	for (i; i < n / 2; i++)
	{
		s[i] = p->data;
		p = p->next;
	}
	i--;//指过头了，拉回来，跳出循环时i指向了中间结点的下一给结点了
	if (n % 2 == 1)
	{
		p = p->next;
	}
	while (p != NULL&&s[i] == p->data)
	{
		i--;
		p = p->next;
	}
	if (i == -1)
	{
		return 1;
	}
	else
		return 0;
}