6. Print the linked list from end to beginning (reversePrint)
1. python
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
stack = []
while head:
stack.append(head.val)
head = head.next
stack.reverse()
return stack
2. Java
class Solution {
public int[] reversePrint(ListNode head) {
Stack<ListNode> stack = new Stack<ListNode>();
while(head!=null){
stack.push(head);
head=head.next;
}
int size = stack.size();
int[] ret = new int[size];
for(int i=0;i<size;i++){
ret[i]=stack.pop().val;
}
return ret;
}
}