剑指offer-06-从尾到头打印链表-golang

题目：输入一个链表的头结点，从尾到头反过来打印出每个节点的值。

type Node struct {
	val  int
	next *Node
}

func printListNode(head *Node) []int {
	if head == nil {
		return []int{}
	}
	p, q := head.next, head
	res := make([]int, 0)
	resRear := make([]int, 0)
	res = append(res, q.val)

	for p != nil {
		q = p
		p = p.next
		res = append(res, q.val)
	}
	for i := len(res) - 1; i >= 0; i-- {
		resRear = append(resRear, res[i])
	}

	return resRear
}