题目链接:https://leetcode.com/problems/sort-colors/
Given an array with n objects 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: [2,0,2,1,1,0] Output: [0,0,1,1,2,2]
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 a one-pass algorithm using only constant space?
思路:
- 本题是经典的“荷兰国旗”问题模型。
- 可以将问题抽象为在一个无序的集合中,经过处理后使其成为由符合要求的3个子集合组成的集合。
- 对于任意集合:nums = 【1,2,0,... ,0, 2, 1】
- 可以用两个变量作为数组下标分别指向下标:L = -1, R = nums.size(); (-1, nums.size()此时不存在)
- 则此时可以抽象认为集合{0} = [0, L](不存在);集合{1} = {}(空集); 集合{2} = [R, nums.size()-1](不存在),待处理集合:nums = 【1,2,0,... ,0, 2, 1】;
- 初始化 i = 0,作为游标,遍历集合nums中的元素, 当 i < R时,遍历继续;
- i在移动遍历过程中,对于nums[i],存在以下三种情况:
- nums[i] == 0 : 此时集合{0}中应该添加此元素,执行交换操作:swap(nums[++L], nums[i++]),然后游标i继续进行判断遍历;
- nums[i] == 1 : 此时只需++i, 然后游标i继续进行判断遍历;
- nums[i] == 1 : 此时集合{1}中应该添加此元素,执行交换操作:swap(nums[--R], nums[i]), 注意此时游标i没有执行++操作,因为执行交换操作后,此时游标i所指元素的值未定,需要继续进行判断。
- 执行完上述操作后,【【0, L】, 【L+1, R-1】,【R, nums.size()-1】】 = 【{0}, {1}, {2}】即为所求。
编码如下:
1 class Solution { 2 public: 3 void sortColors(vector<int>& nums) { 4 int l = -1, r = nums.size(); 5 6 int i = 0; 7 while (i < r) 8 { 9 if (nums[i] == 0) 10 { 11 swap(nums[++l], nums[i++]); 12 } 13 else if (nums[i] == 1) 14 { 15 ++i; 16 } 17 else if (nums[i] == 2) 18 { 19 swap(nums[i], nums[--r]); 20 } 21 } 22 } 23 };