LeetCode：Sort Colors

最新推荐文章于 2018-09-19 08:24:21 发布

原创最新推荐文章于 2018-09-19 08:24:21 发布 · 562 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #hash

LeetCode 同时被 2 个专栏收录

48 篇文章

订阅专栏

LeetCode

48 篇文章

订阅专栏

本文介绍了一种不使用标准库排序函数的颜色排序算法。该算法通过哈希计数的方式统计红、白、蓝三种颜色的数量，并按顺序重新排列数组中的元素。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

// Source : https://oj.leetcode.com/problems/sort-colors/
// Author : Chao Zeng
// Date   : 2014-12-22
//hash排序
class Solution {
public:
    void sortColors(int A[], int n){
        int hashnum[3];
        for (int i = 0; i < 3; i++){
                hashnum[i] = 0;
        }
        for (int i = 0; i < n; i++){
            hashnum[A[i]]++;
        }
        int i;
        for (i = 0; i < hashnum[0]; i++)
            A[i] = 0;

        for (i = hashnum[0]; i < hashnum[0] + hashnum[1]; i++)
            A[i] = 1;

        for (i = hashnum[0] + hashnum[1]; i < hashnum[0] + hashnum[1] + hashnum[2]; i++)
            A[i] = 2;

        for (int i = 0; i < n; i++)
            printf("%d ",A[i]);
    }
};