判断一条单向链表是不是“回文”

用到之前的C实现链表

http://blog.csdn.net/edwards_june/article/details/54380468

int isPalindrome(LNode *s, int n) {	//n是长度
	if (0 > n) {
		return 0;
	} else {
		LNode *node = s;
		int index = n / 2 + (n % 2 == 0 ? 0 : 1);
		int i = index + 1;
		Type data;
		StackLink *p = (StackLink*) malloc(sizeof(StackLink));
		initStack(p);
		for (; i <= n; i++) {
			if ((data = get(&node, i)) != NULL) {
				push(p, data);
			}
		}
		int length = getStackLength(p);
		ElemType elem;
		while (length-- > 0) {
			pop(p, &elem);
			if (node->data != elem) {
				return 0;
			}
			node = node->next;
		}
		return 1;
	}
}