剑指offer06.从头到尾打印链表[简单]
题目:
输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例:
输入:head = [1,3,2]
输出:[2,3,1]
题解:
1、建一个新ArrayList,让Node结点值依次加入,使用Collections.reverse()工具类反转。再创建一个同样大小的int数组,遍历加入。以下是完整代码:
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
public class of_06 {
public static void main(String[] args) {
ListNode node1 = new ListNode(1);
ListNode node2 = new ListNode(2);
ListNode node3 = new ListNode(3);
node1.next = node2;
node2.next = node3;
System.out.println(Arrays.toString(reversePrint(node1)));
}
public static int[] reversePrint(ListNode head) {
ArrayList<Integer> list = new ArrayList<Integer>();
while(head != null){
list.add(head.val);
head = head.next;
}
Collections.reverse(list);
int[] arr = new int[list.size()];
for(int i = 0; i < list.size(); i++){
arr[i] = list.get(i);
}
return arr;
}
}
class ListNode{
int val;
ListNode next;
ListNode(int x){val=x;}
}
2、建立一个新的LinkedlList链表起名为stack,同样遍历将所有Node值add依次其中。新建int数组,再利用LinkedList.removeLast()每次移除并返回最后一个元素依次赋给数组(实现了反转)。以下是solution代码:
class Solution {
public int[] reversePrint(ListNode head) {
LinkedList<Integer> stack = new LinkedList<Integer>();
while(head != null){
stack.add(head.val);
head = head.next;
}
int[] arr = new int[stack.size()];
for(int i = 0; i < arr.length; i++){
arr[i] =stack.removeLast();
}
return arr;
}
}