递归实现从尾到头打印链表

public static void main(String[] args) {

		ListNode n1 = new ListNode(1);
		ListNode n2 = new ListNode(2);
		ListNode n3 = new ListNode(6);
		ListNode n4 = new ListNode(4);
		ListNode n5 = new ListNode(2);

		n1.next = n2;
		n2.next = n3;
		n3.next = n4;
		n4.next = n5;
		ArrayList list1=new ArrayList();
		list1 = printListFromTailToHead(n1,list1);
		for (int i = 0; i < list1.size(); i++) {
			System.out.print("->" + list1.get(i));

		}
	}

public static ArrayList<Integer> printListFromTailToHead(ListNode listNode,ArrayList list) {
		// 反转链表
		if (listNode != null) {
			if (listNode.next != null) {
				printListFromTailToHead(listNode.next,list);
			}
			list.add(listNode.val);
		}
		return list;
	}