本文探讨了在一个包含红、白、蓝三色元素的数组中，如何使用特定算法将这些元素按颜色顺序排列。介绍了一种两遍计数排序的直接解决方案，并提出了一次遍历的恒定空间复杂度挑战。
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.
Follow up:
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.
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?
扫一扫
341
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
