题解 | #从尾到头打印链表#
从尾到头打印链表
http://www.nowcoder.com/practice/d0267f7f55b3412ba93bd35cfa8e8035
递归
vector<int> printListFromTailToHead(ListNode* head)
{
vector<int> v;
if (head)
{
v = printListFromTailToHead(head->next);
v.push_back(head->val);
}
return v;
}