WEI-CHENG CHEN

說明

合併兩個有序 linklist

解法

題目給的兩兩指針，去比較，將結過作成新 linklist 去做返回

class Solution {
public:
    ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) {
        // NOTE01
        ListNode* dummy = new ListNode(0);
        // 遍歷的指針
        ListNode* cur = dummy;

        while(list1 && list2){
            if(list1->val<=list2->val){
                cur->next = list1;
                cur = cur->next;
                list1 = list1->next;
            }else{
                cur->next = list2;
                cur = cur->next;
                list2 = list2->next;
            }
        }

        //  迴圈結束，有一格linklist還沒完成，剩餘的直接插上去新的linklist
        if(list1) cur->next = list1;
        else cur->next = list2;
        return dummy->next;
    }
};