Merge Two Sorted Lists

题目本身比较简单，无非就是对c语言中指针的剪切操作，no trick

public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode node=new ListNode(Integer.MIN_VALUE);
          ListNode head=node;
          while(l1!=null&&l2!=null){
              if(l1.val<l2.val){
                  node.next=l1;
                  l1=l1.next;
              }else{
                  node.next=l2;
                  l2=l2.next;
              }
              node=node.next;
          }

          if(l1==null){
              node.next=l2;

          }else{
              node.next=l1;
          }
          return head.next;
    }