摘要：
#include #include "link.h"/*合并两个排序链表*/LinkNode * mergeLink(LinkNode *& pHead1, LinkNode *& pHead2){ if(pHead1 == NULL) return pHead2; else if(pHead2 == NULL) return pHead1; LinkNode * pHead =0; if(pHead1->_value _value) { pHead = pHead1; pHead->_next = merg... 阅读全文
摘要：
/*翻转单链表*/void reverseLink(LinkNode *& pHead){ if(pHead == NULL) return; LinkNode *pre,*cur,*next; pre = pHead; cur = pHead->_next; pre->_next = NULL; while(cur != NULL) { next = cur->_next; cur->_next = pre; pre = cur; cur = next; } pHead... 阅读全文