从尾到头打印链表-golang
/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/
func printListReversingly(head *ListNode) []int {
var data []int
for head != nil{
data = append(data, head.Val)
head = head.Next
}
l := len(data)
for i := 0; i < l/2; i++{
data[i], data[l-i-1] = data[l-i-1], data[i]
}
return data
}