Commit f01e136

committed

Sort colors

1 parent 4d29a81 commit f01e136Copy full SHA for f01e136

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`	`+"Leetcode- https://leetcode.com/problems/sort-colors/ "`
	`2`	`+'''`
	`3`	`+Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white, and blue.`
	`4`	`+`
	`5`	`+We will use the integers 0, 1, and 2 to represent the color red, white, and blue, respectively.`
	`6`	`+`
	`7`	`+You must solve this problem without using the library's sort function.`
	`8`	`+`
	`9`	`+Example 1:`
	`10`	`+`
	`11`	`+Input: nums = [2,0,2,1,1,0]`
	`12`	`+Output: [0,0,1,1,2,2]`
	`13`	`+'''`
	`14`	`+def sortColors(self, nums):`
	`15`	`+ l=0`
	`16`	`+ r=len(nums)-1`
	`17`	`+ m=0`
	`18`	`+`
	`19`	`+ while m<=r:`
	`20`	`+ if nums[m]==0:`
	`21`	`+ nums[m],nums[l]=nums[l],nums[m]`
	`22`	`+ l+=1`
	`23`	`+ m+=1`
	`24`	`+ elif nums[m]==2:`
	`25`	`+ nums[m],nums[r]=nums[r],nums[m]`
	`26`	`+ r-=1`
	`27`	`+ else:`
	`28`	`+ m+=1`
	`29`	`+ return nums`
	`30`	`+`
	`31`	`+#T=O(n)`
	`32`	`+#S=O(1)`

Comments

(0)