首页 > 代码库 > LeetCode: Merge Two Sorted Lists 解题报告
LeetCode: Merge Two Sorted Lists 解题报告
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.
Show Tags
SOLUTION 1:
使用dummynode记录头节点的前一个，轻松完成，2分钟就AC啦！
1 /** 2 * Definition for singly-linked list. 3 * public class ListNode { 4 * int val; 5 * ListNode next; 6 * ListNode(int x) { 7 * val = x; 8 * next = null; 9 * }10 * }11 */12 public class Solution {13 public ListNode mergeTwoLists(ListNode l1, ListNode l2) {14 ListNode dummy = new ListNode(0);15 ListNode cur = dummy;16 17 while (l1 != null && l2 != null) {18 if (l1.val < l2.val) {19 cur.next = l1;20 l1 = l1.next;21 } else {22 cur.next = l2;23 l2 = l2.next;24 }25 cur = cur.next;26 }27 28 if (l1 != null) {29 cur.next = l1;30 } else {31 cur.next = l2;32 }33 34 return dummy.next;35 }36 }
GITHUB:
https://github.com/yuzhangcmu/LeetCode_algorithm/blob/master/list/MergeTwoLists_1206.java
LeetCode: Merge Two Sorted Lists 解题报告
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。