线性结构的逆置:
线性表的逆置
手摇算法:liming−and−jenny→jenny−and−liming
线性表的逆置:
a[0],a[n]交换
a[1],a[n-1]交换
a[2],a[n-2]交换
a[3],a[n-3]交换……(i指向low,j指向high,当low<high运行)
for(int i = left, j = right; i < j; ++i, --j)
temp = a[i] ;
a[i] = a[j] ;
a[j] = temp;
}
和
链表的逆置:
逆置p->next到q之间的结点(选择插入操作)
while(p->next != q)
{
t = p->next;
p->next = t->next;
t->next = q->next;
q->next = t;
}