【2021秋冬】【剑指offer】25. 合并两个排序的链表

/**
 * 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 res = new ListNode(0);
        ListNode cur = res;
        while(l1!=null&&l2!=null){
            if(l1.val > l2.val){
                res.next = l2;
                l2 = l2.next;
            }else if(l1.val <= l2.val){
                res.next = l1;
                l1 = l1.next;
            } 
            res = res.next;
        }
        res.next = (l1 != null) ? l1 : l2;
        return cur.next;

    }
}