【大厂高频算法题】合并两个排序的链表

public class Solution {
    public ListNode Merge(ListNode list1, ListNode list2) {
        // 设置合并链表的伪头节点
        ListNode head = new ListNode(0);
        // 将当前节点进行初始化
        ListNode cur = head;
        // 对list1和list2进行交替合并
        while (list1 != null && list2 != null) {
            if (list1.val < list2.val) {
                cur.next = list1;
                list1 = list1.next;
                cur = cur.next;
            } else {
                cur.next = list2;
                list2 = list2.next;
                cur = cur.next;
            }
        }
        // 处理末尾节点
        if (list1 != null) {
            cur.next = list1;
        } else {
            cur.next = list2;
        }
        return head.next;
    }
}