Sword finger offer 06 Print linked list from end to end

leetcode Force button to brush questions and punch in

subject ： The finger of the sword Offer 06. Print linked list from end to end
describe ： Enter the head node of a linked list , Return the value of each node from the end to the end （ Return with array ）.

Their thinking

1、 Traversing the linked list , Store the value of each linked list node in the array , And then use reverse Function invert array ;

Source code ##

class Solution {
    
public:
    vector<int> reversePrint(ListNode* head) {
    
        vector<int>v;
        while (head) {
    
            v.emplace_back(head->val);
            head = head->next;
        }
        reverse(v.begin(), v.end());
        return v;
    }
};