songxt

描述：Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Given linked list – head = [4,5,1,9], which looks like following:4 -> 5 -> 1 -...

描述：Reverse a singly linked list.Example:Input: 1->2->3->4->5->NULLOutput: 5->4->3->2->1->NULL分析：链表经典题，给定一个单链表，求将它反转之后的链表。思路一：迭代法。可以将迭代法