剑指offer-倒序打印链表

typedef struct linkList
{
int data;
struct linkList *next;
}ListNode;
void ReversinglyPrint(ListNode *phead)
{
std::stack<ListNode *> nodes;
ListNode *p = phead;
while (p!= NULL)
{
nodes.push(p);
p = p->next;
}
while (!nodes.empty())
{
p = nodes.pop();
printf("%d  ", p->data);
nodes.pop();
}
}

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());
return res;
}
};