去重合并两个链表

在这里插入代码function ListNode(value){
      this.value = value
      this.next = null
    }
    //去重合并两个链表
    function merge(l1,l2){
      var l = new ListNode(0)
      var current = l.head
      l1 = l1.head
      l2 = l2.head
      while(l1!==null&&l2!==null){
        if(l1.value>l2.value){
          current.next = new ListNode(l2.value)
          l2 = l2.next
        }else if(l1.value<l2.value){
          current.next = new ListNode(l1.value)
          l1=l1.next
        }else{  //等于的情况
          current.next = new ListNode(l1.value)
          l2=l2.next
          l1=l1.next
        }
        current = current.next
      }
      if(l1!==null){
        current.next = l1
      }
      if(l2!==null){
        current.next = l2
      }
      return l.head.next
    }片