题目描述
输入一个链表,按链表从尾到头的顺序返回一个ArrayList。
题目来源: 牛客网
思路: 链表遍历, 不断头插
链表遍历方法:
for (cur = head; cur != NULL; cur = cur->next);
代码示例:
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
vector<int> ret;
if (head == NULL)
return ret;
ListNode* cur = NULL;
for (cur = head; cur != NULL; cur = cur->next)
{
ret.insert(ret.begin(), cur->val);
}
return ret;
}
};