剑指offer链表01

输入一个链表的头节点，从尾到头反过来返回每个节点的值（用数组返回）。

/**递归
 * 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!=NULL)
      DFS(head);
      return ans;
    }
    void DFS(ListNode* h){
        if(h->next!=NULL){
            DFS(h->next); //递归
        }
        ans.push_back(h->val);
    }
};
//栈
class Solution {
public:
    vector<int> reversePrint(ListNode* head) {
    ListNode* h=head;
    stack<int> s;
    vector<int> ans;
    while(h!=NULL){
        s.push(h->val);
        h=h->next;
    }
    while(!s.empty()){
        ans.push_back(s.top());
        s.pop();
    }
    return ans;
    }
};