思路:翻转链表,
import java.util.ArrayList;
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}
public class Solution {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
ListNode node = listNode;
ArrayList<Integer> list = new ArrayList<Integer>();
while(node != null){
list.add(node.val);
node = node.next;
}
// 翻转
ArrayList<Integer> newList = new ArrayList<Integer>();
for(int i=list.size()-1; i>=0; i--){
newList.add(list.get(i));
}
return newList;
}
}
好像用Java有点作弊的感觉,还用了俩链表
明天再做一遍
总结:明天一块