题:https://leetcode.com/problems/sort-colors/description/
题目:
Given an array 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.
Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.
Note: You are not suppose to use the library’s sort function for this problem.
Example:
Input: [2,0,2,1,1,0]
Output: [0,0,1,1,2,2]
思路:
这是道median的题,一看看上去以为蛮简单的,但写出来的算法不好,看了讨论区的算法,还是是惊艳。
算法的思想是先所有的有置为2,然后遍历一遍数,若该数小于2 ,置1位置数加一同时它扫过的区域都置为1。若该数为0,置0位置数加一同时它扫过的区域都置为0。
code
class Solution:
def sortColors(self, nums):
"""
:type nums: List[int]
:rtype: void Do not return anything, modify nums in-place instead.
"""
j = k = 0
for i in range(len(nums)):
v = nums[i]
nums[i] = 2
if v<2:
nums[j] = 1
j += 1
if v ==0:
nums[k] =0
k += 1