从尾到头打印链表

public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
        ArrayList<Integer> list = new ArrayList<>();
        if(listNode == null) return list;
        ListNode current = listNode;
        ListNode temp = null;
        ListNode next = null;
        while(current!=null){
            next = current.next;
            current.next = temp;
            temp = current;
            current = next;
        }
        while(temp!=null){
            list.add(temp.val);
            temp = temp.next;
        }
        return list;
    }

public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
        Stack<Integer> stack = new Stack<>();
        ArrayList<Integer> arrayList = new ArrayList<>();
        if(listNode == null) return arrayList;
        while(listNode!=null){
            stack.push(listNode.val);
            listNode = listNode.next;
        }
        while(!stack.isEmpty()){
            arrayList.add(stack.pop());
        }
        return arrayList;
    }