原理简单就不说了,贴出代码。
数组的
def merge(p,q):
x=[]
ii,jj=len(p),len(q)
i=j=0
while i<ii and j<jj:
if p[i]<q[j]:
x.append(p[i])
i+=1
else:
x.append(q[j])
j+=1
if i<ii:
x.extend(p[i:])
if j<jj:
x.extend(q[j:])
return x
def sortL(n):
if not n or len(n)==1:
return n
mid=int((0+len(n)-1)/2)
return merge(sortL(n[:mid+1]),sortL(n[mid+1:]))
链表的(同时也是LeetCode147答案)
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def sortList(self, head: ListNode) -> ListNode:
if not head or not head.next:
return head
pre=fast=slow=head
while fast and fast.next:
pre=slow
fast=fast.next.next
slow=slow.next
pre.next=None
return self.merge(self.sortList(head),self.sortList(slow))
def merge(self,p,q):
cur=l=ListNode(0)
while p and q:
if p.val<q.val:
cur.next=p
p=p.next
cur=cur.next
else:
cur.next=q
q=q.next
cur=cur.next
if p:
cur.next=p
if q:
cur.next=q
return l.next