class Solution {
public:
ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) {
ListNode* curList1 = list1;
ListNode* curList2 = list2;
ListNode* newHead = new ListNode();
ListNode* curNode = newHead;
while(curList1 && curList2){
if(curList1->val >= curList2->val){
curNode->next = curList2;
curList2 = curList2->next;
curNode = curNode->next;
}else{
curNode->next = curList1;
curList1 = curList1->next;
curNode = curNode->next;
}
}
if(curList1){
curNode->next = curList1;
}
if(curList2){
curNode->next = curList2;
}
newHead = newHead->next;
return newHead;
}
};
LeetCode Hot100 21. 合并两个有序链表
最新推荐文章于 2024-08-19 10:30:41 发布