首页 > 代码库 > 【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.
水题不解释,一A,代码如下:
1 /** 2 * Definition for singly-linked list. 3 * struct ListNode { 4 * int val; 5 * ListNode *next; 6 * ListNode(int x) : val(x), next(NULL) {} 7 * }; 8 */ 9 class Solution { 10 public: 11 ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) { 12 ListNode* head; 13 if(l1 == NULL) 14 return l2; 15 if(l2 == NULL) 16 return l1; 17 18 if(l1->val < l2->val) 19 { 20 head = l1; 21 l1 = l1->next; 22 } 23 else 24 { 25 head = l2; 26 l2 = l2->next; 27 } 28 ListNode* current = head; 29 while(l1 != NULL && l2 != NULL){ 30 if(l1->val < l2->val){ 31 current->next = l1; 32 l1 = l1->next; 33 current = current->next; 34 } 35 else 36 { 37 current->next = l2; 38 l2 = l2->next; 39 current = current->next; 40 } 41 } 42 if(l1 != NULL) 43 current->next = l1; 44 if(l2 != NULL) 45 current->next = l2; 46 return head; 47 } 48 };
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。