摘要： http://oj.leetcode.com/problems/reverse-nodes-in-k-group/ 链表 指针 对链表翻转的变形#include using namespace std; struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} }; ListNode *reverse(ListNode * l2) { ListNode *n1,*n2,*before; n1 = l2; n2 = n1->next; ... 阅读全文