LeetCode-Sort Colors

最新推荐文章于 2020-03-29 00:08:04 发布

原创最新推荐文章于 2020-03-29 00:08:04 发布 · 444 阅读

0 ·

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

标签

#leetcode #Sort Colors

Cracking LeetCode 同时被 2 个专栏收录

152 篇文章

订阅专栏

Math Game

50 篇文章

订阅专栏

本文介绍了一种在不使用库函数的情况下，通过一次遍历解决数组中相同颜色元素相邻排列的问题，具体实现了一个名为`sortColors`的算法，用于将数组中的元素按照红色、白色、蓝色的顺序进行排序。

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?

Solution:

Code:

<span style="font-size:14px;">class Solution {
public:
    void sortColors(int A[], int n) {
        int begin = 0, end = n-1, index = 0;
        while (index <= end) {
            if (A[index] == 0) {
                A[index] = A[begin];
                A[begin++] = 0;
                if (begin > index) index = begin;
            } else if (A[index] == 2) {
                A[index] = A[end];
                A[end--] = 2;
            } else
                index++;
        }
    }
};</span>