LeetCode:Sort Colors

Posted 2020-07-21 walker lee

Sort Colors

Total Accepted: 101116 Total Submissions: 289438 Difficulty: Medium

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.

Follow up:
A rather straight forward solution is a two-pass algorithm using counting sort.
First, iterate the array counting number of 0‘s, 1‘s, and 2‘s, then overwrite array with total number of 0‘s, then 1‘s and followed by 2‘s.

Could you come up with an one-pass algorithm using only constant space?

Subscribe to see which companies asked this question

Hide Tags

 Array Two Pointers Sort

Hide Similar Problems

 (M) Sort List (M) Wiggle Sort (M) Wiggle Sort II

c++ code:

class Solution {
public:
        
    void sortColors(vector<int>& nums) {
        int r=0, w=0, b=0; // label the end of different colors;
        for(int num: nums){
            if(num==0) {
                nums[b++]=2;
                nums[w++]=1;
                nums[r++]=0; 
            } 
            else if(num==1) {
                nums[b++]=2;
                nums[w++]=1;
            }
            else if(num==2)
                b++;
        }
    }
};