超简洁递归
从尾到头打印链表
http://www.nowcoder.com/questionTerminal/d0267f7f55b3412ba93bd35cfa8e8035
class Solution
{
public:
vector<int> printListFromTailToHead(ListNode* head)
{
vector<int> return_array;
if(head)
{
if (head->next) return_array = printListFromTailToHead(head->next);
return_array.push_back(head->val);
}
return return_array;
}
};
查看14道真题和解析
