【LeetCode】【Python】Sort Colors

最新推荐文章于 2019-08-24 17:36:00 发布

原创最新推荐文章于 2019-08-24 17:36:00 发布 · 2.9k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#python #插入排序 #遍历

Python 同时被 2 个专栏收录

25 篇文章

订阅专栏

LeetCode的Python题解

12 篇文章

订阅专栏

本文介绍了一种在不使用库排序函数的情况下，将数组中红、白、蓝三种颜色按顺序排列的算法。通过一次遍历并利用常数空间，实现原地排序。文中还探讨了如何避免多次遍历和额外空间使用的技巧。

Given an array with n objects colored red, white or blue, sort them 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.

click to show follow up.

Follow up:
A rather straight forward solution is a two-pass algorithm using counting sort.
First, iterate the array counting number of 0's, 1's, and 2's, then overwrite array with total number of 0's, then 1's and followed by 2's.

Could you come up with an one-pass algorithm using only constant space?

要求遍历一遍且使用有限的空间，我想了很久都是需要两次遍历或是额外的空间，看了一个思路很简洁的代码，觉得不错分享给大家。但这个代码也有缺点，就是类似于插入排序，需要移动大量元素的位置，时间复杂度也是蛮高的。

class Solution:
    # @param A a list of integers
    # @return nothing, sort in place
    def sortColors(self, A):
        i=j=k=-1
        n=len(A)
        for m in range(n):
            if A[m]==0:
                k=k+1
                A[k]=2
                j=j+1
                A[j]=1
                i=i+1
                A[i]=0
            elif A[m]==1:
                k=k+1
                A[k]=2
                j=j+1
                A[j]=1
            else:
                k=k+1
                A[k]=2