剑指offer06题-从尾到头打印链表

输入一个链表的头节点，从尾到头反过来返回每个节点的值（用数组返回）。

示例 1：

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

解题思路

1.将链表的值放入数组，然后反转数组

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> reversePrint(ListNode* head) {
    vector<int>res;
    while(head)
    {
       res.push_back(head->val);
       head=head->next; 
    }
    reverse(res.begin(),res.end());
    return res;
    }
};

2.递归

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
   
    vector<int> reversePrint(ListNode* head) {
    
     if(head==NULL)
       return {};
     vector<int>res=reversePrint(head->next);
     res.push_back(head->val);
     return res;
    }
};