21. Merge Two Sorted Lists

来源:互联网 发布:淘宝如何申请小二介入 编辑:程序博客网 时间:2024/05/16 19:02
/** * Definition for singly-linked list. * struct ListNode { *     int val; *     ListNode *next; *     ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public:    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {      ListNode*L = NULL,*q=NULL;if (l1 == NULL&&l2 == NULL)return NULL;if (l1 == NULL&&l2 != NULL)return l2;if (l1 != NULL&&l2 == NULL)return l1;if (l1->val <= l2->val){L = l1;l1 = l1->next;}else{L = l2;l2 = l2->next;}q = L;while (l1 != NULL&&l2 != NULL){if (l1->val <= l2->val){q->next = l1;l1 = l1->next;}else{q->next = l2;l2 = l2->next;}q = q->next;}if (l1 != NULL)q->next = l1;if (l2 != NULL)q->next = l2;return L;    }};

0 0
原创粉丝点击