描述
输入一个链表的头节点,按链表从尾到头的顺序返回每个节点的值(用数组返回)。
如输入{1,2,3}的链表如下图:
返回一个数组为[3,2,1]
0 <= 链表长度 <= 10000
示例1
输入:{1,2,3}
返回值:[3,2,1]
示例2
输入:{67,0,24,58}
返回值:[58,24,0,67]
代码:
/**
* 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<Integer>();
ListNode find = listNode;
while(find!= null){
list.add(find.val);
find = find.next;
}
int len = list.size();
for(int i = 0 ; i < len/2 ;i++){
int temp = list.get(i);
list.set(i,list.get(len-i-1));
list.set(len-i-1,temp);
}
return list;
}
}
简单粗暴法:
public class Solution {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
ArrayList<Integer> result = new ArrayList<>();
while (listNode!=null){
// 正序
result.add(listNode.val);
// 循环变化
listNode = listNode.next;
}
// 倒序
result = reserverResult(result);
if(result.size() > 10000 || result.size() < 0){
return null;
}
return result;
}
private ArrayList<Integer> reserverResult(ArrayList<Integer> result) {
ArrayList<Integer> reserver = new ArrayList<>();
for (int i = result.size()-1; i >= 0; i--) {
reserver.add(result.get(i));
}
return reserver;
}
}
方法三:利用栈原理,先进后出
Stack<Integer> stack = new Stack<>();
// 正序输入
while (listNode!=null){
stack.push(listNode.val);
listNode = listNode.next;
}
// 输入到数组
ArrayList<Integer> result = new ArrayList<>();
while (!stack.isEmpty()){
result.add(stack.pop());
}
if(result.size() > 10000 || result.size() < 0){
return null;
}
return result;