逆转单链表

问题 思路 cur = pre->next; post = cur=>next; cur->next = pre; cur = post; 代码  ListNode* reverseList(ListNode *root) { if (root == NULL) return root; ListNode *cur = root; ListNode *pre

>>阅读原文<<