刷题-链表翻转

非递归

/**
*    public class ListNode {
*        int val;
*        ListNode next = null;
*
*        ListNode(int val) {
*            this.val = val;
*        }
*    }
*
*/
import java.util.ArrayList;
public class Solution {
    public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
        ArrayList<Integer> outputList = new ArrayList<>();
        while(listNode != null) {
            outputList.add(listNode.val);
            listNode = listNode.next;
        }
        ArrayList<Integer> outputArray = new ArrayList<>();
        for(int i=0;i<outputList.size();i++) {
            outputArray.add(outputList.get(outputList.size()-i-1));
        }
        return outputArray;
    }
}

递归——永远学不会用递归系列

链表太长，会报错，Exception in thread “main” java.lang.StackOverflowError

/**
*    public class ListNode {
*        int val;
*        ListNode next = null;
*
*        ListNode(int val) {
*            this.val = val;
*        }
*    }
*
*/
import java.util.ArrayList;
public class Solution {
    ArrayList<Integer> outputList = new ArrayList<>();
    public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
        dfs(listNode);
        return outputList;
    }
    void dfs(ListNode listNode){
        if(listNode == null){
            return;
        }
        dfs(listNode.next);
        outputList.add(listNode.val);
    }
}

栈Stack

利用栈先进后出的特点

/**
*    public class ListNode {
*        int val;
*        ListNode next = null;
*
*        ListNode(int val) {
*            this.val = val;
*        }
*    }
*
*/
import java.util.*;
public class Solution {
    ArrayList<Integer> outputList = new ArrayList<>();
    Stack<Integer> stack = new Stack<>();
    public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
        while(listNode != null){
            stack.push(listNode.val);
            listNode = listNode.next;
        }
        while(!stack.empty()){
            outputList.add(stack.pop());
        }
        return outputList;
    }
}