思路:让链表的指向反过来从而达到逆置的效果
比如1->2->3->4->5=>5->4->3->2->1.
cur->next=prev;让指向下一个结点的结点指向前面的空指针.
然后依次向后改变结点指向的方向.
struct ListNode* reverseList( ListNode* head) {
ListNode* cur = head;
ListNode* prev = NULL;
while (cur) {
struct ListNode* tmp = cur->next;
cur->next = prev;
prev = cur;
cur = tmp;
}
return prev;
}