输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:
输入:head = [1,3,2] 输出:[2,3,1]
限制:
0 <= 链表长度 <= 10000
法一:
/**
* 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!=nullptr)
{
res.push_back(head->val);
head=head->next;
}
reverse(res.begin(),res.end());
return res;
}
};
法二:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
vector<int>ans;
vector<int> reversePrint(ListNode* head) {
if(!head)return ans;
reversePrint(head->next);
ans.push_back(head->val);
return ans;
}
};