T6 输入一个链表,按链表从尾到头的顺序返回一个ArrayList。
方法一:反向迭代器
/*
struct ListNode{
int val;
ListNode* next;
ListNode(int x): val(x),next(nullptr){}
};
*/
class Solution {
public:
vector<int> reversePrint(ListNode* head) { //vector为模板类
vector<int> v ;
while (head != nullptr){ //不断输入链表
v.push_back(head -> val);
head = head -> next;
}
vector<int> v1(v.rbegin() , v.rend() );
//vector<int> v1;
//v1.assign(v.rbegin(),v.rend());
return v1;
}
};
方法二:栈
/**
* struct ListNode {
* int val;
* struct ListNode *next;
* ListNode(int x) :
* val(x), next(NULL) {
* }
* };
*/
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
vector<int> v;
stack<int> s;
while (head != nullptr){ //输入链表并存到栈中
//v.push_back(head -> val);
s.push(head -> val);
head = head -> next;
}
while(!s.empty()){ //从栈中退出元素并存入Vector中
v.push_back(s.top()); //s.top()引用栈顶对象
s.pop(); //s.pop()删除栈顶对象
}
return v;
}
};
方法三:前插法(效率低)
/**
* struct ListNode {
* int val;
* struct ListNode *next;
* ListNode(int x) :
* val(x), next(NULL) {
* }
* };
*/
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
vector <int> v;
while (head != nullptr)
{
v.insert(v.begin() ,head ->val);
head = head -> next;
}
return v;
}
};