MergeTwoSortedLists.java

/*https://leetcode.com/problems/merge-two-sorted-lists/submissions/*/

//standard merge procedure
class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode newList = new ListNode(0);
        ListNode temp = newList;
        while (l1 != null && l2 != null)
        {
            if (l1.val <= l2.val)
            {
                temp.next = l1;
                l1 = l1.next;
            }
            else
            {
                temp.next = l2;
                l2 = l2.next;
            }
            temp = temp.next;
        }
        while (l1 != null)
        {
            temp.next = l1;
            l1 = l1.next;
            temp = temp.next;
        }
        while (l2 != null)
        {
            temp.next = l2;
            l2 = l2.next;
            temp = temp.next;
        }
        return newList.next;
    }
}