Leetcode: 75. Sort Colors

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.

思路

  • 跟快排的partition一个思想,两个index,一个从前往后,一个从后往前,前面这个对应0, 后面那个对应2

代码

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

转载于:https://www.cnblogs.com/lengender-12/p/6925867.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值