LEETCODE: Merge Two Sorted Lists

来源：互联网发布：多益网络是什么编辑：程序博客网时间：2024/04/27 19:22

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

这么基础的题，居然一时想不起来解法了。注意要记住的指针！

/** * 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) {        if(l1 == NULL)  return l2;        if(l2 == NULL)  return l1;        ListNode *newhead = l1->val < l2->val ? l1 : l2;                while(l1 != NULL && l2 != NULL) {            if(l1->val < l2->val) {                ListNode* last = NULL;                while(l1 != NULL && l1->val < l2->val) {                    last = l1;                    l1 = l1->next;                }                last->next = l2;            }            else {                ListNode* last = NULL;                while(l2 != NULL && l1->val >= l2->val) {                    last = l2;                    l2 = l2->next;                }                last->next = l1;            }        }                return newhead;    }};

0 0