递归

vector<int> printListFromTailToHead(ListNode* head)
{
	vector<int> v;
	if (head)
	{
		v = printListFromTailToHead(head->next);
		v.push_back(head->val);
	}
	return v;
}