@@ -0,0 +1,1188 @@
+package me.wayne.leetcode;%0A%0A/**%0A * %E5%B0%86%E4%B8%A4%E4%B8%AA%E5%8D%87%E5%BA%8F%E9%93%BE%E8%A1%A8%E5%90%88%E5%B9%B6%E4%B8%BA%E4%B8%80%E4%B8%AA%E6%96%B0%E7%9A%84 %E5%8D%87%E5%BA%8F %E9%93%BE%E8%A1%A8%E5%B9%B6%E8%BF%94%E5%9B%9E%E3%80%82%E6%96%B0%E9%93%BE%E8%A1%A8%E6%98%AF%E9%80%9A%E8%BF%87%E6%8B%BC%E6%8E%A5%E7%BB%99%E5%AE%9A%E7%9A%84%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E6%89%80%E6%9C%89%E8%8A%82%E7%82%B9%E7%BB%84%E6%88%90%E7%9A%84%0A * %3Cp%3E%0A * https://leetcode-cn.com/problems/merge-two-sorted-lists/%0A */%0A@SuppressWarnings(%22ALL%22)%0Apublic class MergeTwoLists %7B%0A%0A    private class ListNode %7B%0A        int val;%0A        ListNode next;%0A%0A        ListNode(int x) %7B%0A            val = x;%0A        %7D%0A    %7D%0A%0A    public ListNode mergeTwoLists(ListNode l1, ListNode l2) %7B%0A        ListNode result = new ListNode(0);%0A        ListNode head = result;%0A        while (l1 != null %7C%7C l2 != null) %7B%0A            if (l1 == null) %7B%0A                result.next = l2;%0A                result = result.next;%0A                l2 = l2.next;%0A                continue;%0A            %7D%0A%0A            if (l2 == null) %7B%0A                result.next = l1;%0A                result = result.next;%0A                l1 = l1.next;%0A                continue;%0A            %7D%0A%0A            if (l1.val %3C l2.val) %7B%0A                result.next = l1;%0A                result = result.next;%0A                l1 = l1.next;%0A            %7D else %7B%0A                result.next = l2;%0A                result = result.next;%0A                l2 = l2.next;%0A            %7D%0A        %7D%0A%0A        return head.next;%0A    %7D%0A%7D%0A

add MergeTwoLists file