Sword finger offer 06. print linked list from end to end

Title Description

Ideas ： Use the last in first out feature of stack to realize

1. Create a stack

2. Traversing the linked list , Stack the values corresponding to the linked list nodes

3. Declare an array , The length is the length of the stack , Out of the stack

Knowledge point ： Stack , Linked list

Stack related knowledge points ： Refer to this blog

The finger of the sword Offer 09. Queues are implemented with two stacks _jcxj2934 The blog of -CSDN Blog

Related knowledge points of linked list ：

Pictured , The data structure of linked list contains three values ,

The first is an integer , That is, the value corresponding to the node

The second is the pointer , That is to point to the next node （ effect ： Connect linked lists ）

Pictured , Because of the pointer to the next node , Linked lists can be connected

The end node does not point to an object , The value of the pointer is null 

The third is assignment , Assign values to the nodes in the linked list

The code is as follows

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public int[] reversePrint(ListNode head) {
         // Create a stack , Take advantage of the last in first out feature of the stack 
        // Create a pointer to the head of the linked list 
        // Create an array , The length is the size of the stack 
        Stack<Integer> st;
        st=new Stack<>();
        while(head != null) // The pointer value of the tail node is null To determine whether the linked list is traversed 
        {
            st.push(head.val);
            head=head.next;
        }
        int n =st.size();
        int result[] = new int [n];
        int i=0;
        while(!st.empty())
        {
            result[i]=st.pop();
            i++;
        }
        return result;

    }
}