链表倒序打印,自己的方法有点蠢,如下:
/**
* struct ListNode {
* int val;
* struct ListNode *next;
* ListNode(int x) :
* val(x), next(NULL) {
* }
* };
*/
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
ListNode* pointer = head;
vector<int> A;
while(pointer!=NULL)
{
A.push_back(pointer->val);
pointer = pointer->next;
}
return vector<int>(A.rbegin(),A.rend());
}
};
在看大神们的答案的时候,发现一个简单而有趣的做法,如下:
链接:https://www.nowcoder.com/questionTerminal/d0267f7f55b3412ba93bd35cfa8e8035
来源:牛客网
vector<int> printListFromTailToHead(struct ListNode* head) {
vector<int> v;
while(head != NULL)
{
v.insert(v.begin(),head->val);
head = head->next;
}
return v;
}