题目描述
输入一个链表,按链表值从尾到头的顺序返回一个ArrayList
。
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
vector<int> ret;
if(head == NULL)
return ret;
stack<int> st;
ListNode* tmp = head;
while(tmp != NULL)
{
st.push(tmp->val);
tmp = tmp->next;
}
while(!st.empty())
{
ret.push_back(st.top());
st.pop();
}
return ret;
}
};
class Solution {
public:
vector<int> printListFromTailToHead(struct ListNode* head) {
vector<int> vec;
printListFromTailToHead(head,vec);
return vec;
}
void printListFromTailToHead(struct ListNode* head,vector<int> &vec)
{
if(head!=nullptr)
{
if(head->next!=nullptr)
{
printListFromTailToHead(head->next,vec);
}
vec.push_back(head->val);
}
}
};