简单
这题用递归代码量最少
学习下面的代码能学到很多东西
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
vector<int> reversePrint(ListNode* head) {
if(!head) return {};
vector<int> res= reversePrint(head->next);
res.push_back(head->val);
return res;
}
};