您当前位置：首页 > php框架 > 框架设计 > leetcode || 75、Sort Colors

leetcode || 75、Sort Colors

来源：程序员人生发布时间：2015-04-27 08:36:44 阅读次数：2998次

problem：

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?

Hide Tags

Array Two Pointers Sort

题意：将由0、1、2组成的数组按升序排序，不能使用字典排序

thinking：

（1）最简单的是使用计数法，计算0、1、2 的个数，最后再填充

（2）最优算法是快速排序的变形：1次遍历完成排序

code：

class Solution { public: void sortColors(int A[], int n) { int i = 0; // 0 pointer int j = n - 1; // 1 pointer int k = n - 1; // 2 pointer while (i <= j) { if (A[i] == 2) { int t = A[k]; A[k] = A[i]; A[i] = t; k--; if (k < j) j = k; } else if (A[i] == 1) { int t = A[j]; A[j] = A[i]; A[i] = t; j--; } else i++; } } };

生活不易，码农辛苦
如果您觉得本网站对您的学习有所帮助,可以手机扫描二维码进行捐赠
程序员人生

------分隔线----------------------------

上一篇 6/6plus适配的问题

下一篇 使用Httpclient模拟登陆正方软件股份有限公司开发的教务管理系统

分享到:

------分隔线----------------------------

为码而活

积分：4237

15粉丝

7关注

栏目热点