首页 > 代码库 > [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.
https://oj.leetcode.com/problems/merge-two-sorted-lists/
思路：增加一个dummy head方便处理。然后按照merge的操作来即可。
/** * Definition for singly-linked list. public class ListNode { int val; ListNode * next; ListNode(int x) { val = x; next = null; } } */public class Solution { public ListNode mergeTwoLists(ListNode l1, ListNode l2) { if (l1 == null) return l2; if (l2 == null) return l1; ListNode p1 = l1; ListNode p2 = l2; ListNode head = new ListNode(-1); ListNode p = head; while (p1 != null && p2 != null) { if (p1.val <= p2.val) { p.next = p1; p1 = p1.next; } else { p.next = p2; p2 = p2.next; } p = p.next; } if (p1 != null) p.next = p1; if (p2 != null) p.next = p2; return head.next; } public static void main(String[] args) { ListNode l1 = ListUtils.makeList(2, 3, 5, 7); ListNode l2 = ListUtils.makeList(1, 4, 5, 9); ListNode newHead = new Solution().mergeTwoLists(l1, l2); ListUtils.printList(newHead); }}
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。