void reverse() {
if (!(m_head == m_tail)){
Node *p1 = m_tail = m_head;
Node *p2 = p1->m_next;
Node *p3 = p2->m_next;
for (p1->m_next = NULL; p3; p3 = p3->m_next) {
p2->m_next = p1;
p1 = p2;
p2 = p3;
}
p2->m_next = p1;
m_head = p2;
}
单链表的逆序
最新推荐文章于 2022-09-08 21:35:42 发布