编写一个函数,给定一个头指针,要求只遍历一次,将单链表中的元素反转过来。 Node* m_node::ReserveNode(Node *head) { if (head==NULL) return NULL; Node *pRes = head; Node *pNext = head->next; pRes->next = NULL; while(pNext!=NULL) { head = pNext->next; pNext->next = pRes; pRes = pNext; pNext = head; } head = pRes; return head; }