将一个单链表逆序struct test{int number;double score;test* next;}void reverse(test*& head){test* pe = head;test* ps = head->next;while(ps = NULL){pe->next = ps->next;ps->next = head;head = ps;ps = pe->next;}}
来源:学生作业帮助网 编辑:作业帮 时间:2024/07/02 03:27:07
![将一个单链表逆序struct test{int number;double score;test* next;}void reverse(test*& head){test* pe = head;test* ps = head->next;while(ps = NULL){pe->next = ps->next;ps->next = head;head = ps;ps = pe->next;}}](/uploads/image/z/3722057-17-7.jpg?t=%E5%B0%86%E4%B8%80%E4%B8%AA%E5%8D%95%E9%93%BE%E8%A1%A8%E9%80%86%E5%BA%8Fstruct+test%7Bint+number%3Bdouble+score%3Btest%2A+next%3B%7Dvoid+reverse%28test%2A%26+head%29%7Btest%2A+pe+%3D+head%3Btest%2A+ps+%3D+head-%3Enext%3Bwhile%28ps+%3D+NULL%29%7Bpe-%3Enext+%3D+ps-%3Enext%3Bps-%3Enext+%3D+head%3Bhead+%3D+ps%3Bps+%3D+pe-%3Enext%3B%7D%7D)
将一个单链表逆序struct test{int number;double score;test* next;}void reverse(test*& head){test* pe = head;test* ps = head->next;while(ps = NULL){pe->next = ps->next;ps->next = head;head = ps;ps = pe->next;}}
将一个单链表逆序
struct test
{
int number;
double score;
test* next;
}
void reverse(test*& head)
{
test* pe = head;
test* ps = head->next;
while(ps = NULL)
{
pe->next = ps->next;
ps->next = head;
head = ps;
ps = pe->next;
}
}
将一个单链表逆序struct test{int number;double score;test* next;}void reverse(test*& head){test* pe = head;test* ps = head->next;while(ps = NULL){pe->next = ps->next;ps->next = head;head = ps;ps = pe->next;}}
数据结构就不用讲了吧...
下面的函数体是这样:
pe指向链表头
ps指向链表头的下一个节点
原链表头的下一结点不空时{
原链表头的下一节点 指向 ps的下一结点
ps的下一结点指向现链表头
链表头指向ps
ps指向原链表头的下一结点
}
循环中的四步完成了把原链表头的下一个节点移到链表头的动作,重复到原链表头为链表尾为止.这样就完成了链表的倒序