剑值offer 面试题 6.从尾到头打印链表 完整代码

剑值offer面试题6：输入一个链表的头节点，从尾到头反过来返回每个节点的值（用数组返回）。

示例 1：
输入：head = [1,3,2]
输出：[2,3,1]

#include <iostream>
#include <vector>
#include <string>

using namespace std;

struct ListNode{  //定义ListNode结构
    int val;
    ListNode *next;
    ListNode(int x): val(x), next(NULL) {}
};

vector<int> reversePrint(ListNode* head)  //翻转打印
{
    int len = 0;
    ListNode* p = head;

    while(p != NULL)  //统计链表节点数
    {
        ++len;
        p = p->next;
    }

    vector<int> res(len, 0);
    int i = len - 1;
    p = head;

    while(p != NULL)  //从尾到头打印
    {
        res[i] = p->val;
        --i;
        p = p->next;
    }

    return res;
}

void test01()
{
	//建立链表
    ListNode *one = new ListNode(1);  
    ListNode *two = new ListNode(3);
    ListNode *three = new ListNode(2);
    ListNode *four = new ListNode(5);

    one->next = two;
    two->next = three;
    three->next = four;

    vector<int> res;
    res = reversePrint(one);
    int len = res.size();

    for(int i = 0; i < len; i++)  //打印输出
    {
        cout << res[i] << ' ';
    }
    cout << endl;
}

int main()
{
    test01();   //测试
    return 0;
}