need review
/**
* 2019/11/30
* similar to lc. 88
* review needed
*
*
*
* Definition for singly-linked list.
* public class ListNode { int val; ListNode next;
* ListNode(int x) { val = x; } }
*/
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode dummy = new ListNode(0);
ListNode currNode = dummy;
while (l1 != null && l2 != null) {
if (l1.val < l2.val) {
currNode.next = l1;
l1 = l1.next;
} else {
currNode.next = l2;
l2 = l2.next;
}
currNode = currNode.next;
}
if (l1 != null) {
currNode.next = l1;
} else {
currNode.next = l2;
}
return dummy.next;
}
}