Commit79d8fee

authored

Create 0912-sort-an-array.py

1 parent2a77937 commit79d8feeCopy full SHA for 79d8fee

File tree

+32

-0

lines changed

+32

-0

lines changed

Lines changed: 32 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,32 @@`
	`1`	`+classSolution:`
	`2`	`+defsortArray(self,nums:List[int])->List[int]:`
	`3`	`+defmerge(arr,L,M,R):`
	`4`	`+left,right=arr[L:M+1],arr[M+1:R+1]`
	`5`	`+i,j,k=L,0,0`
	`6`	`+whilej<len(left)andk<len(right):`
	`7`	`+ifleft[j]<=right[k]:`
	`8`	`+arr[i]=left[j]`
	`9`	`+j+=1`
	`10`	`+else:`
	`11`	`+arr[i]=right[k]`
	`12`	`+k+=1`
	`13`	`+i+=1`
	`14`	`+whilej<len(left):`
	`15`	`+nums[i]=left[j]`
	`16`	`+j+=1`
	`17`	`+i+=1`
	`18`	`+whilek<len(right):`
	`19`	`+nums[i]=right[k]`
	`20`	`+k+=1`
	`21`	`+i+=1`
	`22`	`+`
	`23`	`+defmergeSort(arr,l,r):`
	`24`	`+ifl==r:`
	`25`	`+returnarr`
	`26`	`+m= (l+r)//2`
	`27`	`+mergeSort(arr,l,m)`
	`28`	`+mergeSort(arr,m+1,r)`
	`29`	`+merge(arr,l,m,r)`
	`30`	`+returnarr`
	`31`	`+`
	`32`	`+returnmergeSort(nums,0,len(nums)-1)`

Comments

(0)