#21.Merge Two Sorted Lists [LeetCode Grind 75 in Java]

class Solution {
    public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
        ListNode p1 = list1;
        ListNode p2 = list2;

        ListNode ans = new ListNode(0);
        ListNode p3 = ans;

        while(p1 != null && p2 != null){
            if(p1.val < p2.val){
                p3.next = p1;
                p1 = p1.next;
            }else{
                p3.next = p2;
                p2 = p2.next;

            }
            p3 = p3.next;
            p3.next = null;
        }

        if(p1 != null){
            p3.next = p1;
        }

        if(p2 != null){
            p3.next = p2;
        }

        return ans.next;

    }
}