8.从尾到头打印链表

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func reversePrint(head *ListNode) []int {
    cur := head
    var pre *ListNode = nil
    res :=make([]int,0)
    for cur != nil {
        pre, cur, cur.Next = cur, cur.Next, pre
    }

    for pre!=nil{
        res=append(res,pre.Val)
        pre=pre.Next
    }

    return res
}