class Solution {
public int[] printListReversingly(ListNode head) {
Stack[HTML_REMOVED] stack = new Stack();
ListNode index = head;
int num = 0;
while(index != null) {
stack.push(index.val);
num++;
index = index.next;
}
int[] result = new int[num];
int i = 0;
while(!stack.isEmpty()) {
result[i++] = stack.pop();
}
return result;
}
}
1.说到倒序就想到栈
2.也可以第一次遍历就改变指针方向,向回遍历是放入数组并再次改变指针方向(如果需要保证连标不变)