?

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(NULL==l1) return l2;if(NULL==l2) return l1;ListNode* head = NULL;if(l1->val < l2->val) {head = l1; l1 = l1->next; }else { head = l2; l2 = l2->next;}ListNode* p = head; // pointer to form new listwhile(l1!=NULL&&l2!=NULL){if(l1->val < l2->val){p->next = l1;l1 = l1 ->next;}else {p->next = l2;l2 = l2 ->next;}p = p->next;}if(l1){p->next = l1;}else{p->next = l2;}return head;} };

?

遞歸c++解法：

class Solution { public:ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {if(l1 == NULL) return l2;if(l2 == NULL) return l1;if(l1->val < l2->val) {l1->next = mergeTwoLists(l1->next, l2);return l1;} else {l2->next = mergeTwoLists(l2->next, l1);return l2;}} };

?

?

python遞歸解決方式：

?

def mergeTwoLists(self, l1, l2):if not l1:return l2elif not l2:return l1else:if l1.val <= l2.val:l1.next = self.mergeTwoLists(l1.next, l2)return l1else:l2.next = self.mergeTwoLists(l1, l2.next)return l2

?

?

python非遞歸：

# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = Noneclass Solution:# @param {ListNode} l1# @param {ListNode} l2# @return {ListNode}def mergeTwoLists(self, l1, l2):p1 = l1p2 = l2guard = ListNode(0)q = guardwhile p1 is not None and p2 is not None:if p1.val <= p2.val:q.next = p1p1 = p1.nextq = q.nextelse:q.next = p2p2 = p2.nextq = q.nextif p1 is not None:q.next = p1if p2 is not None:q.next = p2return guard.next

?

python遞歸解決方式2：

If both lists are non-empty, I first make sure a starts smaller, use its head as result, and merge the remainders behind it. Otherwise, i.e., if one or both are empty, I just return what's there.class Solution:def mergeTwoLists(self, a, b):if a and b:if a.val > b.val:a, b = b, aa.next = self.mergeTwoLists(a.next, b)return a or b

?

轉(zhuǎn)載于:https://www.cnblogs.com/mfrbuaa/p/5371604.html

《新程序員》：云原生和全面數(shù)字化實踐50位技術(shù)專家共同創(chuàng)作，文字、視頻、音頻交互閱讀

總結(jié)

以上是生活随笔為你收集整理的leetcode 21 Merge Two Sorted Lists的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。