[leetcode]75. Sort Colors

最新推荐文章于 2024-09-16 17:05:22 发布

你看见我的代码了么

最新推荐文章于 2024-09-16 17:05:22 发布

阅读量89

点赞数

分类专栏： LeetCode Medium 文章标签： leetcode

本文链接：https://blog.csdn.net/weixin_32135877/article/details/86700242

版权

LeetCode 同时被 2 个专栏收录

336 篇文章 0 订阅

订阅专栏

Medium

162 篇文章 0 订阅

订阅专栏

[leetcode]75. Sort Colors

Analysis

还没工作就想退休—— [每天刷题并不难0.0]

Given an array 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.
Note: You are not suppose to use the library’s sort function for this problem.
在这里插入图片描述

Explanation:

不能用库函数，空间复杂度为O(1)的前提下只遍历一遍对数组进行排序。

Implement

solution 1：（double points，把0一移到数组前面，2移到数组后面）

class Solution {
public:
    void sortColors(vector<int>& nums) {
        int len = nums.size();
        int red = 0;
        int blue = len-1;
        for(int i=0; i<len;){
            if(nums[i] == 0 && i>red){
                swap(nums[i], nums[red]);
                red++;
            }
            else if(nums[i] == 2 && i<blue){
                swap(nums[i], nums[blue]);
                blue--;
            }
            else
                i++;
        }
    }
};

solution 2：（计数法，记录下红白蓝三种颜色的个数，然后直接填充就行了）

class Solution {
public:
    void sortColors(vector<int>& nums) {
        int len = nums.size();
        int red = 0;
        int white = 0;
        int blue = 0;
        for(int i=0; i<len; i++){
            if(nums[i] == 0)
                red++;
            if(nums[i] == 1)
                white++;
            if(nums[i] == 2)
                blue++;
        }
        int i;
        for(i=0; i<red; i++)
            nums[i] = 0;
        for(i=0; i<white; i++)
            nums[i+red] = 1;
        for(i=0; i<blue; i++)
            nums[i+red+white] = 2;
    }
};