Leet Code 21 合并两个有序链表 - Java

问题原始链接 https://leetcode.com/problems/merge-two-sorted-lists

合并两个有序链表，返回新的链表，新链表通过连接原链表的节点组成。

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
  public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
    ListNode dummyHead = new ListNode(0);
    ListNode p = dummyHead;
    while (l1 != null && l2 != null) {
      if (l1.val <= l2.val) {
        p.next = l1;
        l1 = l1.next;
      } else {
        p.next = l2;
        l2 = l2.next;
      }
      p = p.next;
    }
    p.next = l1 != null ? l1 : l2;
    return dummyHead.next;
  }
}

 

转载于:https://my.oschina.net/mistymarch/blog/688894