输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:
输入:head = [1,3,2]
输出:[2,3,1]
限制:
0 <= 链表长度 <= 10000
Python
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def reversePrint(self, head):
"""
:type head: ListNode
:rtype: List[int]
"""
ins = []
outs = []
while(head):
ins.append(head.val)
head = head.next
i = len(ins) - 1
while(i >= 0):
outs.append(ins[i])
i -= 1
return outs
#经验:1.list用append插入元素,len(list)表示元素个数,[i]可以表示第几个
C++
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
vector<int> reversePrint(ListNode* head) {
vector<int>in;
vector<int>out;
while(head)
{
in.push_back(head->val);
head=head->next;
}
for(int i=in.size()-1;i>=0;i--)
{
out.push_back(in[i]);
}
return out;
}
};
//经验:1.vector可以用push_back写入,pop_back移出,可以用[i]表示第几位,size(),empty()都可以用