题解 | #合并两个排序的链表#
合并两个排序的链表
https://www.nowcoder.com/practice/d8b6b4358f774294a89de2a6ac4d9337
需要两个指针，一个用来存储合并后的链表，一个用来在循环过程中进行操作，最后返回存放链表的指针的next就可以了
/**
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
/**
*
* @param pHead1 ListNode类
* @param pHead2 ListNode类
* @return ListNode类
*/
struct ListNode* Merge(struct ListNode* pHead1, struct ListNode* pHead2 ) {
// write code here
struct ListNode *pHead,*p;
pHead = (struct ListNode *)malloc(sizeof(struct ListNode));
pHead -> val = -1;
p = pHead;
if(!pHead1)return pHead2;
if(!pHead2)return pHead1;
while(pHead1 && pHead2 ){
if(pHead1 -> val <= pHead2 -> val){
p -> next = pHead1;
pHead1 = pHead1 -> next;
}else{
p -> next = pHead2;
pHead2 = pHead2 -> next;
}
p = p -> next;
}
p -> next = pHead1 ? pHead1 : pHead2;
return pHead -> next;
}
，现在知道急了，而且你这个简历完全可以写成一页，劣势太大了，建议转测试