首页 > 代码库 > leetcode [64] merge tow sorted lists
leetcode [64] merge tow sorted lists
之前忘记记录这题了,现在补上。
合并两个有序的list,要求是:
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 *tmp = new ListNode(0); ListNode *head = tmp; while(l1 && l2) { if (l1 -> val <= l2 -> val) { tmp -> next = l1; tmp = l1; l1 = l1 -> next; } else { tmp -> next = l2; tmp = l2; l2 = l2 -> next; } } if (l1) { tmp -> next = l1; } else { tmp -> next = l2; } return head -> next;}};
leetcode [64] merge tow sorted lists
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。