Talk is cheap.
/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/
func printListReversingly(head *ListNode) []int {
var res []int
cur := head
for cur != nil {
res = append(res, cur.Val)
cur = cur.Next
}
return reverse(res)
}
func reverse(res []int) []int {
i, j := 0, len(res) - 1
for i < j {
res[i], res[j] = res[j], res[i]
i += 1
j -= 1
}
return res
}