题目:输入一个链表,从尾到头打印链表每个节点的值。
方法一:
/**
* 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> list = new ArrayList<>();
ArrayList<Integer> result = new ArrayList<>();
while(listNode != null) {
list.add(listNode.val);
listNode = listNode.next;
}
for (int i = list.size() - 1; i >= 0; i--) {
result.add(list.get(i));
}
return result;
}
}
方法二:
想到利用栈来操作!既然想到了栈,就会想到递归!
import java.util.ArrayList;
import java.util.Stack;
public class Solution {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
Stack stack = new Stack<Integer>();
ArrayList<Integer> result = new ArrayList<>();
while(listNode != null) {
stack.push(listNode.val);
}
while(!stack.isEmpty()) {
result.add((Integer)stack.pop());
}
return result;
}
}
递归:
import java.util.ArrayList;
public class Solution {
ArrayList<Integer> result = new ArrayList<>();
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
if(listNode != null) {
printListFromTailToHead(listNode.next);
result.add(listNode.val);
}
return result;
}
}