从尾到头打印链表

题目描述
输入一个链表，按链表从尾到头的顺序返回一个ArrayList。

思路1：借用栈
先进后出
从头到尾入栈
出栈就是从尾到头的顺序

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
public:
    vector<int> printListFromTailToHead(ListNode* head) {
        vector<int> res;
        stack<ListNode*> s;
        while(head != NULL){
            s.push(head);
            head = head->next;
        }
        while(!s.empty()){
            res.push_back(s.top()->val);
            s.pop();
        }
        return res;
    }
};

思路2：反转

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
public:
    vector<int> printListFromTailToHead(ListNode* head) {
        vector<int> res;
        while(head != NULL){
            res.push_back(head->val);
            head = head->next;
        }
        //其实就是实现reverse(res.begin(),res.end())
        int i = 0,j = res.size()-1;
        while(i < j){
            swap(res[i],res[j]);
            i++;
            j--;
        }
        return res;
    }
};

思路3：递归
其实根本思想还是栈的先进后出

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
private:
    vector<int> res;
public:
    vector<int> printListFromTailToHead(ListNode* head) {
        
        if(head != NULL && (head->next != NULL))
            printListFromTailToHead(head->next);
        if(head != NULL)
            res.push_back(head->val);
        return res;
    }
};