题目:输入一个链表,按链表值从尾到头的顺序返回一个ArrayList。
解题思路:
一种方法是利用栈来实现;
另外一种方法是利用三个指针把链表反转,关键是 r 指针保存断开的节点。
解题代码:
1,循环遍历,反转链表
/**
* 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) {
if(listNode == null)
return new ArrayList<Integer>();
ListNode head = listNode;
ListNode cur = listNode.next;
while( cur!= null){
ListNode temp = cur.next;
cur.next = head;
head = cur;
cur = temp;
}
//此时listNode的next还指向第二个node,所以要让listNode.next=null,防止循环
listNode.next = null;
ArrayList<Integer> res = new ArrayList<Integer>();
while(head !=null){
res.add(head.val);
head = head.next;
}
return res;
}
}
2,递归反转链表
public static class Node {
public int value;
public Node next;
public Node(int data) {
this.value = data;
}
}
public Node reverse(Node head) {
if (head == null || head.next == null)
return head;
Node temp = head.next;
Node newHead = reverse(head.next);
temp.next = head;
head.next = null;
return newHead;
}
3,利用栈 逆序输出:
/**
* public class ListNode {
* int val;
* ListNode next = null;
*
* ListNode(int val) {
* this.val = val;
* }
* }
*
*/
import java.util.Stack;
import java.util.ArrayList;
public class Solution {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
Stack<Integer> stack = new Stack<>();
while (listNode != null) {
stack.push(listNode.val);
listNode = listNode.next;
}
ArrayList<Integer> list = new ArrayList<>();
while (!stack.isEmpty()) {
list.add(stack.pop());
}
return list;
}
}
参考文章:
1,https://blog.csdn.net/YQlakers/article/details/69943774
2,https://www.cnblogs.com/keeya/p/9218352.html
3,https://blog.csdn.net/weiwei121451070/article/details/81742418