合并两个有序链表

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.

Subscribe to see which companies asked this question

package com.dengpf.MergeTwoSortedList.Solution;

/**
 * Created by kobe73er on 16/12/20.
 * Definition for singly-linked list.
 * public class ListNode {
 * int val;
 * ListNode next;
 * ListNode(int x) { val = x; }
 * }
 */
public class Solution {

    ListNode rList = new ListNode(0);
    ListNode head = rList;

    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if (l1 == null && l2 == null) {
            return null;
        }
        while (l1 != null && l2 != null) {

            if (l1.val < l2.val) {
                rList.val = l1.val;
                l1 = l1.next;

            } else {
                rList.val = l2.val;
                l2 = l2.next;
            }
            rList.next = new ListNode(0);
            rList = rList.next;

        }
        if (l1 == null) {
            rList.val = l2.val;
            rList.next = l2.next;
        }
        if (l2 == null) {
            rList.val = l1.val;
            rList.next = l1.next;
        }

        return head;

    }

    public static void main(String args[]) {
        ListNode l1 = new ListNode(1);
        l1.next = new ListNode(2);
        l1.next.next = new ListNode(3);


        ListNode l2 = new ListNode(4);
        l2.next = new ListNode(5);
        l2.next.next = new ListNode(6);

        Solution ins = new Solution();
        ins.mergeTwoLists(l1, l2);
        System.out.println("1");
    }

}