该博客介绍了如何用Python解决LeetCode上的75题——Sort Colors，要求将数组中的红、白、蓝三种颜色的元素按顺序进行原地排序。文章提到了一种双遍历的计数排序方法，并询问是否能设计出仅使用常量空间的一次遍历算法。在博客内容中给出了简单的Python解法。
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]
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 a one-pass algorithm using only constant space?
这道题目很简单，就是排序
Python解法如下：
<
最低0.47元/天 解锁文章
扫一扫
1507
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
