剑指offer--从尾到头打印链表

题目描述

输入一个链表，从尾到头打印链表每个节点的值。
节点定义：

public class ListNode {
        int val;
        ListNode next = null;

        ListNode(int val) {
            this.val = val;
        }
}

思路一

利用栈，先入后出

import java.util.*;
public class Solution {
    public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
        LinkedList<Integer> stack = new LinkedList<Integer>();
        ArrayList<Integer> result = new ArrayList<Integer>();
        //入栈
        ListNode point = listNode;
        while(point != null){
            stack.addFirst(point.val);
            point = point.next;
        }

        //出栈
        while(stack.size() > 0){
            result.add(stack.removeFirst());
        }

        return result;
    }
}

思路二

利用递归，非常巧妙

import java.util.ArrayList;
public class Solution {
    private ArrayList<Integer> result = new ArrayList<Integer>();
    public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
        if(listNode != null){
            printListFromTailToHead(listNode.next);
            result.add(listNode.val);
        }

        return result;
    }
}

思路三

反转链表，再遍历打印

import java.util.ArrayList;
public class Solution {
    public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
        ArrayList<Integer> result = new ArrayList<Integer>();

        if(listNode==null)return result;

        ListNode newList = reverseList(listNode);

        while(newList != null){
            result.add(newList.val);
            newList = newList.next;
        }

        return result;

    }

    //反转链表
    public ListNode reverseList(ListNode listNode){
        ListNode tempHead = new ListNode(0);
        tempHead.next = listNode;

        while(listNode.next != null){
            ListNode p = listNode.next;

            listNode.next = p.next;
            p.next = tempHead.next;
            tempHead.next = p;
        }

        return tempHead.next;
    }
}