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.

题目解答

解题思路

两两比较取最小的
注意链表的引用

代码实现

/** * 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 dummy = new ListNode(0);        //头结点        ListNode cur = dummy;        dummy.next = null;        ListNode min;        while(l1 != null && l2 != null){            if(l1.val < l2.val){                min = l1;                l1 = l1.next;            }else {                min = l2;                l2 = l2.next;            }            cur.next = min;            cur = min;        }        if(l1 != null)            cur.next = l1;        if(l2 != null)            cur.next = l2;        return dummy.next;    }}