struct ListNode
{
int val;
ListNode* next;
ListNode(int x):val(x),next(nullptr){}
};
class Solution
{
public:
vector<int> printListArray(TreeNode* head)
{
vector<int> printList;
while(head)
{
printList.push_back(head->val);
head=head->next;
}
reverse(printList.begin(),printList.end());
return printList;
}
};
C++实现从尾到头打印链表(剑指Offer)
最新推荐文章于 2022-02-23 14:34:27 发布