链表面试题

倒叙打印链表

【数据结构】链表面试题

// 倒叙打印链表 
void ReversePrint(SListNode *pFirst)
{
	SListNode *cur = NULL;
	SListNode *last = NULL;
	while (last!=pFirst)
	{
		cur = pFirst;
		while (cur->Next != last)
		{
			cur = cur->Next;
		}
		printf("%d-->", cur->data);
		last = cur;
	}
	printf("NULL\n");
}

相关文章: