1.题目描述
输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:
输入:head = [1,3,2]
输出:[2,3,1]
2.代码
python版本
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
resList = []
while head:#链表不为空,顺序遍历,将val添加到结果列表中
resList.append(head.val)
head = head.next
return resList[::-1]#将列表反向返回
java版本
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public int[] reversePrint(ListNode head) {
int count = 0;
ListNode curNode = head;
while(curNode != null){//计算链表长度
count++;
curNode = curNode.next;
}
int[] result = new int[count];
curNode = head;
for(int i = count-1;i >= 0;i--){//顺序遍历链表,将val值存入数组
result[i] = curNode.val;
curNode = curNode.next;
}
return result;//返回结果集
}
}