Leetcode 75. Sort Colors

文章作者:Tyan
博客:noahsnail.com  |  CSDN  |  简书

1. Description

Sort Colors

2. Solution

  • Two-pass
class Solution {
public:
    void sortColors(vector<int>& nums) {
        int left = 0;
        int right = nums.size() - 1;
        int red = 0;
        int white = 0;
        int blue = 0;
        for(int i = 0; i < nums.size(); i++) {
            if(nums[i] == 0) {
                red++;
            }
            else if(nums[i] == 1) {
                white++;
            }
            else {
                blue++;
            }
        }
        for(int i = 0; i < red; i++) {
            nums[i] = 0;
        }
        for(int i = red; i < red + white; i++) {
            nums[i] = 1;
        }
        for(int i = red + white; i < nums.size(); i++) {
            nums[i] = 2;
        }
    }
};
  • One-pass, no swap
class Solution {
public:
    void sortColors(vector<int>& nums) {
        int low = 0;
        int mid = 0;
        int high = 0;
        for(int i = 0; i < nums.size(); i++) {
            if(nums[i] == 0) {
                nums[high++] = 2;
                nums[mid++] = 1;
                nums[low++] = 0;
            }
            else if(nums[i] == 1) {
                nums[high++] = 2;
                nums[mid++] = 1;
            }
            else {
                nums[high++] = 2;
            }
        }
    }
};
  • One-pass, swap
class Solution {
public:
    void sortColors(vector<int>& nums) {
        int left = 0;
        int mid = 0;
        int high = nums.size() - 1;
        while(mid <= high) {
            if(nums[mid] == 0) {
                swap(nums[mid], nums[left]);
                left++;
                mid++;
            }
            else if(nums[mid] == 2) {
                swap(nums[mid], nums[high]);
                high--;
            }
            else {
                mid++;
            }
        }
    }
private:
    void swap(int& a, int& b) {
        int temp;
        temp = a;
        a = b;
        b = temp;
    }
};

Reference

  1. https://leetcode.com/problems/sort-colors/description/
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值