Given an arrayNObjects 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.
Example:
Input: [,] Output: [,]
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.
- Cocould you come up with a one-pass algorithm using only constant space?
My code:
Class solution {public: void sortcolors (vector <int> & Nums) {int Len = nums. size (); For (INT I = 1; I <= Len; ++ I) {for (Int J = I-1; j> 0; -- J) {If (Nums [J] <Nums [J-1]) {int con = Nums [J]; Nums [J] = Nums [J-1]; nums [J-1] = con ;}}}}};
Runtime:0 MS, faster100.00% of C ++ online submissions for sort colors.
75. Sort colors