6-8 求链表的倒数第m个元素 分数 15

ElementType Find(List L, int m) 
{
	int count = 0;
	for (struct Node* cur = L; cur != NULL; cur = cur->Next)
	{
		count++;
	}
	if (m > count) 
	{
		return ERROR;
	}
	int n = count - m + 1;
	struct Node* cur = L;
	while(--n)
		cur = cur->Next;
	return cur->Data;
}