leetcode75 - Sort Colors

最新推荐文章于 2024-09-26 10:11:15 发布

i_actor

最新推荐文章于 2024-09-26 10:11:15 发布

阅读量97

点赞数

分类专栏： leetcode 文章标签： leetcode 数据结构算法

本文链接：https://blog.csdn.net/i_actor/article/details/110498045

版权

leetcode 专栏收录该内容

33 篇文章 0 订阅

订阅专栏

题目：
Given an array nums with n objects colored red, white, or blue, sort them in-place 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.

Follow up:

Could you solve this problem without using the library’s sort function?
Could you come up with a one-pass algorithm using only O(1) constant space?
本题要求不使用库的sort函数以及只用O(1)的空间。由于只用012这三个数字，可以使用map(我使用的vector代替)，我个人的算法就是记录每个数字出现的次数，然后按照顺序把nums重置就行了。

class Solution {
public:
    void sortColors(vector<int>& nums) {
        vector<int>buff(3, 0);
        for(auto i:nums)
            buff[i]++;
        for(auto i = 0; i < nums.size(); i++){
            if(i < buff[0])nums[i] = 0;
            else if(i < buff[0] + buff[1])
                nums[i] = 1;
            else nums[i] = 2;
        }
    }
};