Simple java 1ms solution


  • 1
    H
    public class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        
        ListNode head = new ListNode(-1);
        ListNode p = head;
        while(l1 != null ||l2 != null){
            if(l1 == null)  {   p.next = l2; p = p.next; l2 = l2.next;   }
            else if(l2 == null) {   p.next = l1; p = p.next; l1 = l1.next;   }
            else if(l1.val > l2.val)    {   p.next = l2; p = p.next; l2 = l2.next;   }
            else    {   p.next = l1; p = p.next; l1 = l1.next;   }
        }
        return head.next;
    }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.