next return list class Solution: def mergeTwoLists(self, head1, head2): if not head1: # 如果head1为空,直接返回head2 return head2 if not head2: # 如果head2为空,直接返回head1 return head1 pre = ListNode(0) # 使用哑结点简化操作
next = list1; } else { // 如果 list1 没有结点,表明 list2 已遍历完成, // 则将 list2 直接放在 tail 后面 tail.next = list2; } // 返回合并后的链表的头结点 head_pre.next } } 题目链接: Merge Two Sorted Lists : leetcode.com/problems/m 合并两个有序链表: leetcode-cn.com/...
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. » Solve this problem [Thoughts] 简单的实现,也没什么可说的。 [Code] 1:ListNode*mergeTwoLists(ListNode*l1,ListNode*l2){ 2:if(l1==NULL)retur...
【LeetCode算法-21】Merge Two Sorted Lists LeetCode第21题 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. Example: Input: 1->2->4, 1->3->4 Output: 1->1->2->3->4->4 翻译: 合并两...
leetcode 21. 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. Example: Input: 1->2->4, 1->3->4 Output: 1->1->2->3->4->4...
Leetcode: Merge Two Sorted Lists Merge two sorted linked lists andreturnit as anewlist. Thenewlist should be made by splicing together the nodes of the first two lists. Example: Input:1->2->4, 1->3->4Output:1->1->2->3->4->4...
1. Description Merge Two Sorted Lists 2. Solution /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution{public:ListNode*mergeTwoLists(ListNode*l1,ListNode*l2){ListNode*ptrFirst=l1...
1. 题目描述 Merge two sorted linked lists and return it as a new sorted list. The new list should be made by splicing together the nodes of the first two lists. Example: Input:1->2->4,1->3->4Output:1->1->2->3->4->4 ...
* struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2) { //首先判断有没有空链表的情况。。。 if(l1 && !l2) return l1; if(!l1 && l2) return l2; if(!l1 && !l2) return NULL; //还是和之前的...
21. 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. Example: Input: 1->2->4, 1->3->4 Output: 1->1->2->3->4->4...