mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-25 17:32:01 +00:00
17. 从尾到头打印链表
https://www.acwing.com/problem/content/submission/code_detail/2610796/
This commit is contained in:
parent
e8d751e963
commit
40c6b2f336
21
AcWing/17/17.cpp
Normal file
21
AcWing/17/17.cpp
Normal file
@ -0,0 +1,21 @@
|
|||||||
|
/**
|
||||||
|
* Definition for singly-linked list.
|
||||||
|
* struct ListNode {
|
||||||
|
* int val;
|
||||||
|
* ListNode *next;
|
||||||
|
* ListNode(int x) : val(x), next(NULL) {}
|
||||||
|
* };
|
||||||
|
*/
|
||||||
|
class Solution {
|
||||||
|
public:
|
||||||
|
vector<int> printListReversingly(ListNode* head) {
|
||||||
|
vector<int> res;
|
||||||
|
ListNode *tail = head;
|
||||||
|
while(tail != NULL) {
|
||||||
|
res.push_back(tail->val);
|
||||||
|
tail = tail->next;
|
||||||
|
}
|
||||||
|
reverse(res.begin(), res.end());
|
||||||
|
return res;
|
||||||
|
}
|
||||||
|
};
|
Loading…
Reference in New Issue
Block a user