To prove safety offer-- merge the two ordered list

 1 /*
 2 public class ListNode {
 3     int val;
 4     ListNode next = null;
 5 
 6     ListNode(int val) {
 7         this.val = val;
 8     }
 9 }*/
10 public class Solution {
11     public ListNode Merge(ListNode l1,ListNode l2) {
12         if(l1==null)
13             return l2;
14         if(l2==null)
15             return l1;
16         
17         ListNode head = new ListNode(-1);
18         ListNode merge = head;
19         
20         while(l1!=null&&l2!=null)
21         {
22             if(l1.val<l2.val)
23             {
24                 merge.next =l1;
25                 merge = merge.next;
26                 l1 = l1.next;
27             }
28             else
29             {
30                 = Merge.next L2;
31                  Merge = Merge.next;
32                  L2 = L2.next;
33              }
 34          }
 35 the          if (L1! = Hotel Last Minute Deals )
 36          {
 37              Merge.next = L1;
38          }
 39 the          if (L2! = Hotel Last Minute Deals )
 40          {
 41              Merge.next = L2;
42          }
 43          Return Head.next;
44          
45      }
46 }