剑指 Offer 06.从头到尾打印链表

题目描述

问题解析

1.由于输入输出都是数组，所以新建一个数组，用来存放反转以后的数组即从尾部到头的数组
2.其次取出数组的长度赋值给新数组
3.头结点取值赋值给新数组,然后往后遍历,

代码实例

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */
class Solution {
    
    public int[] reversePrint(ListNode head) {
    
       ListNode node = head;
       int len = 0;
       while(node != null){
    
       		len++;
       		node = node.next;//取出数组原始长度
       }
       int[] nums = new int[len];
       while(head != null){
    
       		nums[--len] = head.val;//数组从头到尾依次存储每个节点的值
       		head = head.next;
       }
       return nums;
    }
}


/** * Your CQueue object will be instantiated and called as such: * CQueue obj = new CQueue(); * obj.appendTail(value); * int param_2 = obj.deleteHead(); */
    }
}