21-排序链表的合并

问题：

将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 

输入：1->2->4, 1->3->4

输出：1->1->2->3->4->4

 

作者亲测可以直接运行！！！！！！

public class Solution {
    public static ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode flag = new ListNode(0);
        ListNode firstflag = flag;
        while (l1 != null && l2 != null) {
            if (l1.val < l2.val) {
                flag.next = l1;
                l1 = l1.next;
            } else {
                flag.next = l2;
                l2 = l2.next;
            }
            flag = flag.next;
        }
        flag.next = l1 != null ? l1 : l2;
        return firstflag.next;
    }

    public static void printListNode(ListNode l) {
        while(null != l){
            System.out.println(l.val);
            l = l.next;
        }


    }

    public static void main(String[] args) {
        ListNode listNode1 = new ListNode(1,new ListNode(2,new ListNode(4)));
        ListNode listNode2 = new ListNode(1,new ListNode(3,new ListNode(4)));
        ListNode resultListNode = mergeTwoLists(listNode1,listNode2);
        printListNode(resultListNode);
    }
}

class ListNode {
    int val;
    ListNode next;

    ListNode() {
    }

    ListNode(int val) {
        this.val = val;
    }

    ListNode(int val, ListNode next) {
        this.val = val;
        this.next = next;
    }
}