输入一个链表，从尾到头打印链表每个节点的值。

#include "stdafx.h"
#include<iostream>
#include<fstream>
#include<string>
#include<cctype>
#include <vector>
#include<exception>
#include <initializer_list>
#include<stack>
using namespace std;

struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};

class Solution {
public:
vector<int> printListFromTailToHead(struct ListNode* head) {
//  ListNode *newHead = head;
vector<int> vec01;
vector<int> vec02;
while (head!=NULL)
{
vec01.push_back((*head).val);
head = (*head).next;
}
while (!vec01.empty())
{
vec02.push_back(*(vec01.end()-1));
vec01.pop_back();
}
return vec02;
}
};

int main()
{
int num;
vector<int> vec;
Solution so;

ListNode first(1);
ListNode second(2);
ListNode third(3);
ListNode four(4);
ListNode *head=&first;
first.next = &second;
second.next = &third;
third.next = &four;

vec = so.printListFromTailToHead(head);

//while (vec.begin()!=vec.end())
//{
//  cout << *vec.begin()<<"  ";
//  vec.begin()++;
//}

for (auto it = vec.begin(); it != vec.end(); it++)
{
cout << *it << "  ";
}

//while (head!=NULL)
//{
//  cout << (*head).val<<"  ";
//  head = (*head).next;
//}
cout << endl;

return 0;
}