【GO】剑指offer -- 从尾到头打印链表

非递归：

func printListFromTailToHead( head *ListNode ) []int {
    num:=0
    p := head
    for p!=nil{
        num++
        p = p.Next
    }
    p = head
    res:=make([]int, num)
    for i := num-1;i>=0;i--{
        res[i] = p.Val
        p = p.Next
    }
    return res
}

递归：

func printListFromTailToHead( head *ListNode ) []int {
    if head == nil{
        return []int{}
    }
    res:=printListFromTailToHead(head.Next)
    return append(res, head.Val)
}