文章目录
题目
题目解析
解题思维
代码如下
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public int[] reversePrint(ListNode head) {
if(head == null){
return new int[0];
}
ListNode prev = head;
ListNode cur = head.next;
int n = 1;
while(cur!= null){
ListNode curNext = cur.next;
cur.next = prev;
prev = cur;
n++;
cur = curNext;
}
int[] arr = new int[n];
for(int i = 0;i < n;i++){
arr[i] = prev.val;
prev = prev.next;
}
return arr;
}
}
代码细节 - 逆序