[Leetcode Week2]Sort Colors

最新推荐文章于 2020-07-27 15:20:26 发布

转载最新推荐文章于 2020-07-27 15:20:26 发布 · 113 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/yanhewu/p/7535008.html

本文针对LeetCode上的SortColors问题提供了一种解决方案，采用桶排序的方法对数组中的红色、白色和蓝色对象进行排序，并确保相同颜色的对象相邻且按红、白、蓝的顺序排列。

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

Sort Colors题解

原创文章，拒绝转载

题目来源：https://leetcode.com/problems/sort-colors/description/

Description

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.

Solution

void sortColors(int* nums, int numsSize) {
    int b[3] = {0};
    int i;
    for (i = 0; i < numsSize; i++)
        b[nums[i]]++;
    for (i = 0; i < b[0]; i++)
        nums[i] = 0;
    for (i = b[0]; i < b[0] + b[1]; i++)
        nums[i] = 1;
    for (i = b[0] + b[1]; i < numsSize; i++)
        nums[i] = 2;
}