Leetcode刷题记——75. Sort Colors(颜色排序)

最新推荐文章于 2022-03-03 15:08:52 发布

爱胡椒的小白兔呢

最新推荐文章于 2022-03-03 15:08:52 发布

阅读量499

点赞数 1

CC 4.0 BY-SA版权

分类专栏：刷刷刷题文章标签： java leetcode

本文链接：https://blog.youkuaiyun.com/sunshine0_0/article/details/60333088

刷刷刷题专栏收录该内容

59 篇文章

订阅专栏

这篇博客介绍了LeetCode中75题的颜色排序问题，要求将红色、白色和蓝色的对象按顺序排列。博主提供了两种解题思路，包括直接排序和统计颜色个数进行赋值，并给出了源码实现。

摘要生成于 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.

click to show follow up.

Subscribe to see which companies asked this question.

二、解题思路：

Medium题。

思路1：

（1）直接排序

思路2：

（1）统计每种颜色个数，赋值。

三、源码：

1、

import java.util.Arrays;
public class Solution {
    public void sortColors(int[] nums) 
    {
        Arrays.sort(nums);
    }
}

2、

import java.util.Arrays;
public class Solution {
    public void sortColors(int[] nums) 
    {
       int w = 0;
       int r = 0;
       int b = 0;
       for(int i = 0; i < nums.length; i++)
       {
        if (nums[i] == 0) w++;
        else if (nums[i] == 1) r++;
        else b++;
       }
       for (int i = 0; i < w; i++)
        nums[i] = 0;
       for (int i = w; i < w + r; i++)
        nums[i] = 1;
       for (int i = w+r; i < nums.length; i++)
        nums[i] = 2;
    }
}