Q:
输入一个链表,按链表从尾到头的顺序返回一个ArrayList。
A:
class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}
public class Solution {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
ArrayList<Integer> arrayList = new ArrayList<Integer>();
ArrayList<Integer> result = new ArrayList<Integer>();
ListNode temp = listNode;
while(temp != null){
arrayList.add(listNode.val);
temp = listNode.next;
}
for (int i = arrayList.size()-1; i >= 0; i--){
result.add(arrayList.get(i));
}
return result;
}
public static void main(String[] args) {
Solution solution = new Solution();
}
}