void Inverse(Node *&head) { if(!head) return; Node *Next = head->next; Node *Prev = NULL; head->next = Prev; while(Next){ Prev = head; head = Next; Next = Next->next; head->next = Prev; } }
70,023
社区成员
243,263
社区内容
加载中
试试用AI创作助手写篇文章吧