题目描述:
输入一个链表,从尾到头打印链表每个节点的值。
有两种方法,用递归或者栈
方法一:递归
代码:
/**
* struct ListNode {
* int val;
* struct ListNode *next;
* ListNode(int x) :
* val(x), next(NULL) {
* }
* };
*/
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
vector<int> re;
if(head==NULL)
return re;
printListRec(head,re);
return re;
}
void printListRec(ListNode* head,vector<int> &re){
if(head==NULL)
return;
printListRec(head->next,re);
re.push_back(head->val);
return;
}
};
或者:
/**
* struct ListNode {
* int val;
* struct ListNode *next;
* ListNode(int x) :
* val(x), next(NULL) {
* }
* };
*/
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
vector<int> re;
if(head==NULL)
return re;
re=printListFromTailToHead(head->next);//直接在这个函数用递归
re.push_back(head->val);
return re;
}
};
方法二:用栈
/**
* struct ListNode {
* int val;
* struct ListNode *next;
* ListNode(int x) :
* val(x), next(NULL) {
* }
* };
*/
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
vector<int> re;
if(head==NULL)
return re;
//用栈,避免了递归
stack<int> tmp;
while(head!=NULL){
tmp.push(head->val);
head=head->next;
}
while(!tmp.empty()){
re.push_back(tmp.top());
tmp.pop();
}
return re;
}
};