题目:
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?
题意:
给定一个大小为n, 包含红、白、蓝三种颜色对象的数组,排序使相同的颜色邻近,颜色顺序依次为红色、白色、蓝色。
这里我们使用整数0、1、2分别代表红、白、蓝。
note:这道题不支持使用库函数进行排序。
Follow up:
一个最直接的解决方法是使用计数排序的two-pass算法。
首先,轮训这个数组计数0、1、2的数量,之后按照0、1、2的顺序以及数量复写原数组。
能不能想出只使用常数空间的one-pass算法?
思路一:
两次轮询实现,直接对数组进行轮询计数,统计0、1、2的个数,之后再对原数组直接赋值。
代码:
思路二:
对数组进行轮询,如果为2则跟最后一个元素交换(交换后减一,向前一步),为0跟第一个元素交换(交换后加一,向后一步);
代码:
class Solution { public: void sortColors(vector<int>& nums) { int start = 0; int end = nums.size()-1; for(int i=0; i<=end; i++){ while(nums[i]==2 && i<end){ swap(nums[i], nums[end--]); } while(nums[i]==0 && i>start){ swap(nums[i], nums[start++]); } } } };
思路三:
维持三个变量,对数组进行轮询,如果数组值为0时,三个变量(n0、n1、n2)都加一(因为按照0、1、2的顺序),数组值为1时,n2、n1加一,数组为2时,n2加一。
代码:
class Solution { public: void sortColors(vector<int>& nums) { int n0=-1, n1=-1, n2=-1; for(int i=0; i<nums.size(); i++){ if(nums[i]==0){ nums[++n2] = 2; nums[++n1] = 1; nums[++n0] = 0; }else if(nums[i]==1){ nums[++n2] = 2; nums[++n1] = 1; }else if(nums[i]==2){ nums[++n2] = 2; } } } };转载地址:https://leetcode.com/discuss/20951/four-different-solutions