首页 > 代码库 > LeetCode:Merge Two Sorted Lists
LeetCode:Merge Two Sorted Lists
题目描述:
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
代码:
ListNode * Solution::mergeTwoLists(ListNode *l1, ListNode *l2) { ListNode * newList = NULL; ListNode * rear = NULL; while(l1 != NULL && l2 != NULL) { if(l1->val < l2->val) { insertIntoList(&newList,&rear,l1->val); l1 = l1->next; } else { insertIntoList(&newList,&rear,l2->val); l2 = l2->next; } } while(l1 != NULL) { insertIntoList(&newList,&rear,l1->val); l1 = l1->next; } while(l2 != NULL) { insertIntoList(&newList,&rear,l2->val); l2 = l2->next; } return newList; } void Solution::insertIntoList(ListNode ** newList,ListNode ** rear,int val) { ListNode * newNode = (ListNode *)malloc((sizeof(ListNode))); newNode->val = val; newNode->next = NULL; if((*newList) == NULL) { (*newList) = newNode; (*rear) = newNode; } else { (*rear)->next = newNode; (*rear) = (*rear)->next; } }
LeetCode:Merge Two Sorted Lists
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。