无头链表交换指针之排序

来源:互联网 发布:淘宝小儿介入 编辑:程序博客网 时间:2024/05/17 08:49

暂存!!!!!!!!!!!!!!未完待续!!!!!!!!!!

</pre><pre class="cpp" name="code" snippet_file_name="blog_20160509_2_7680534" code_snippet_id="1676237">//无头链表交换指针之排序,void listSort(L *phead){if (phead == NULL || phead->next == NULL)return;L *pPre = phead;L *pCur = pPre->next;L  pTmp;L  p2Tmp;L  cTmp;while (pCur != NULL || pPre != NULL){//第一轮if (pPre->id > pCur->id){pTmp.next = pCur;pPre->next = pCur->next;pCur->next = pPre;phead = pTmp.next;if (pPre->next == NULL)break;pTmp.next = pPre;pPre = pPre->next;continue;}//第二轮if (pPre->id < pCur->id){cTmp.next = pPre;pCur->next = pPre->next;pPre->next = pTmp.next;pTmp.next->next = pCur;phead = cTmp.next;if (pCur->next == NULL)break;pTmp.next->next = pCur;pCur = pCur->next;}}}

0 0
原创粉丝点击