题目描述
输入一个链表,按链表值从尾到头的顺序返回一个ArrayList。
思路:
先反转链表,再顺序遍历.
方法1: 指针法:顺序遍历,把元素顺序放到头部
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
vector<int> res;
ListNode* pre = NULL;
while(head) {
ListNode* next = head->next;
head->next = pre;
pre = head;
head = next;
}
while(pre) {
res.push_back(pre->val);
pre = pre->next;
}
return res;
}
};
方法2: 堆栈法
class Solution
{
public:
vector<int> printListFromTailToHead(ListNode* head)
{
vector <int> result;
stack<int> arr;
ListNode* p=head;
while(p!=NULL)
{
arr.push(p->val);
p=p->next;
}
int len=arr.size();
for(int i=0;i<len;i++)
{
result.push_back(arr.top());
arr.pop();
}
return result;
}
};