链表面试题

倒叙打印链表

【数据结构】链表面试题

// 倒叙打印链表 
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");
}

相关文章:

  • 2021-07-13
  • 2021-05-17
  • 2021-10-17
  • 2021-06-28
  • 2022-01-08
  • 2021-05-12
  • 2021-08-29
  • 2021-08-04
猜你喜欢
  • 2021-11-14
  • 2023-03-15
  • 2021-08-24
  • 2022-12-23
  • 2022-12-23
  • 2021-04-06
  • 2021-10-22
相关资源
相似解决方案