剑指offer面试题5：从尾到头打印链表

最新推荐文章于 2020-04-15 00:25:46 发布

五条龙

最新推荐文章于 2020-04-15 00:25:46 发布

阅读量182

点赞数

分类专栏： C++

本文链接：https://blog.csdn.net/qq_18344939/article/details/51861943

版权

C++ 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

#include "iostream"
#include <string>
#include "stack"
using namespace std;
struct ListNode{
	int data;
	ListNode *next;
};
void printdigui(ListNode *pHead)
{
	if (pHead!=NULL)
	if (pHead->next != NULL)
		printdigui(pHead->next);
	cout << pHead->data;
}
void print(ListNode *pHead)
{
	stack<ListNode*> nodes;
	if (pHead == NULL)
		return;
	ListNode *pNode=pHead;
	while (pNode!=NULL)
	{
		nodes.push(pNode);
		pNode = pNode->next;
	}
	while (!nodes.empty())
	{
		pNode =nodes.top();
		cout << pNode->data;
		nodes.pop();
	}
}
void removeNode(ListNode **pHead,int value)
{
	if (*pHead == NULL)
		return;
	ListNode *tobedelete=NULL;
	if ((*pHead)->data == value)
	{
		tobedelete = *pHead;
		*pHead = (*pHead)->next;
	}
	else
	{
		ListNode *pNode = *pHead;
		while (pNode->next != NULL&&pNode->next->data != value)
			pNode = pNode->next;
		if (pNode->next != NULL&&pNode->next->data == value)
		{
			tobedelete = pNode->next;
			pNode->next = pNode->next->next;
		}
	}
	if (tobedelete!=NULL)
	{
		delete tobedelete;
		tobedelete = NULL;
	}
}
void addToTail(ListNode **pHead,int value)
{
	ListNode *pNew = new ListNode();
	pNew->data = value;
	pNew->next = NULL;
	if (*pHead == NULL)
		*pHead = pNew;
	else
	{
		ListNode *pNode = *pHead;
		while (pNode->next != NULL)
			pNode = pNode->next;
		pNode->next = pNew;
	}
}
int main()
{
	ListNode *pHead=NULL;
	addToTail(&pHead, 1);
	addToTail(&pHead, 2);
	addToTail(&pHead, 3);
	//removeNode(&pHead, 3);
	/*cout << pHead->data << endl;
	cout << pHead->next->data << endl;*/
	//print(pHead);
	printdigui(pHead);
	system("pause");
	return 0;
}