反向输出链表——利用结构体作为链表元素，vector创建对象简单实现

#include<iostream>
#include<vector>
using namespace std;

	struct ListNode {
		int val;
		ListNode *next;

	};
	ListNode head = {0,NULL};//申请全局变量，初始化头结点，这点很重要，读链表数据时也从此处读取。
	

void insertlist(ListNode *node)//顺序插入，为了简便从头结点开始插入
{
	ListNode *currentNode = &head;//指向头结点
	while (currentNode->next != NULL)
	{
		currentNode = currentNode->next;
	}
	ListNode *tempNode = new ListNode;
	tempNode->val = node->val;
	currentNode->next = tempNode;
	tempNode ->next= NULL;
	//currentNode->next = tempNode;

}
vector<int> printListFromTailToHead(ListNode* head)
{
	vector<int> temp;
	if (head != NULL)
	{
		
		while (head != NULL)
		{
			temp.insert(temp.begin(), head->val);//从次容器的头结点往前插
			head = head->next;
		}
	}
	return temp;

}
int main()
{
	ListNode n1 = {1,NULL};
	ListNode n2 = { 2 ,NULL};
	ListNode n3 = { 3, NULL };
	ListNode n4 = { 4, NULL };
	ListNode *p1 = &n1;
	ListNode *p2 = &n2;
	ListNode *p3 = &n3;
	ListNode *p4 = &n4;
	insertlist(p1);
	insertlist(p2);
	insertlist(p3);
	insertlist(p4);
	vector<int> temp=printListFromTailToHead(&head);

	for (int i = 0; i <temp.size(); i++)
	{
		cout << temp[i];
		
	}
	system("pause");
	return 0;
}