Leetcode Merge Two Sorted Lists

来源：互联网发布：淘宝整点秒杀优惠券编辑：程序博客网时间：2024/05/22 07:52

题意：合并两个排列好的队列。

思路：列表的基本操作。

class Solution {public:    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {        ListNode *nextl1 = l1;        ListNode *nextl2 = l2;                ListNode *head = new ListNode(0);        ListNode *next = head;                while(nextl1 ||nextl2) {            int val1 = 9999999;            int val2 = 9999999;                        if(nextl1) val1 = nextl1->val;            if(nextl2) val2 = nextl2->val;                        if(val1 < val2) {                ListNode *temp = new ListNode(val1);                next->next = temp;                next = temp;                                nextl1 = nextl1->next;            }            else {                ListNode *temp = new ListNode(val2);                next->next = temp;                next = temp;                                nextl2 = nextl2->next;            }        }        return head->next;    }};

0 0