题目:
输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例:
输入:head = [1,3,2]
输出:[2,3,1]
题解:
利用栈的属性,遍历节点,将节点值压入栈中,在将栈中值弹出存入数组即可。
public class ListNode
{
public int val;
public ListNode next;
public ListNode(int x) { val = x; }
}
public class Solution
{
public int[] ReversePrint(ListNode head)
{
Stack<int> stack = new Stack<int>();
int count = 0;
while(head != null)
{
stack.Push(head.val);
count++;
head = head.next;
}
int[] result = new int[count];
for(int i =0;i<count;i++)
{
result[i] = stack.Pop();
}
return result;
}
}