/**
* struct ListNode {
* int val;
* struct ListNode *next;
* ListNode(int x) :
* val(x), next(NULL) {
* }
* };
*/
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
/*vector<int> reslut;
while(head){
reslut.push_back(head->val);
head = head->next;
}
std::reverse(reslut.begin(),reslut.end());
return reslut;*/
ListNode* pre = nullptr;
ListNode* cur = head;
while(cur){
ListNode *tmp = cur->next;
cur->next = pre;
pre = cur;
cur = tmp;
}
vector<int> result;
while(pre){
result.push_back(pre->val);
pre = pre->next;
}
return result;
}
};
反向打印链表
最新推荐文章于 2022-05-08 19:53:08 发布