Sort Colors

发布时间:2017-1-23 16:41:57 编辑 分享查询网我要评论
本篇文章主要介绍了"Sort Colors",主要涉及到Sort Colors方面的内容,对于Sort Colors感兴趣的同学可以参考一下。

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. 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? 首先计算0,1,2出现的个数,然后据此重新填充数组。 void sortColors(int A[], int n) { vector<int> colorNum(3, 0); for(int i = 0; i < n; i++) colorNum[A[i]]++; int m = 0; for(int i = 0; i < 3; i++) { for(int j = 0; j < colorNum[i]; j++) { A[m++] = i; } } }

上一篇:OJ_1103 二次方程计算器
下一篇:URLConnectionReaderDemo 类及其 main()方法


关键词: Sort Colors