首页 > 代码库 > 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.
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?
Analyse: two-pass
1 class Solution { 2 public: 3 void sortColors(vector<int>& nums) { 4 // put all 0s into correct positions 5 int notZero = 0, zero = nums.size() - 1; 6 while (notZero < zero) { 7 if (!nums[notZero]) notZero++; 8 else if (nums[zero]) zero--; 9 else {10 swap(nums[notZero++], nums[zero--]);11 }12 }13 14 // put all 2s into correct positions15 int notTwo = nums.size() - 1;16 while (notZero < notTwo) {17 if (nums[notZero] != 2) notZero++;18 else if (nums[notTwo] == 2) notTwo--;19 else {20 swap(nums[notZero++], nums[notTwo--]);21 }22 }23 }24 };
Analyse: one-pass
1 class Solution { 2 public: 3 void sortColors(vector<int>& nums) { 4 if (nums.size() < 2) return; 5 6 int left = 0, right = nums.size() - 1; 7 int notZero = 0, notTwo = nums.size() - 1; 8 while (left <= right) { 9 if (nums[left] == 2)10 swap(nums[left], nums[notTwo--]);11 else if (nums[right] == 0)12 swap(nums[right], nums[notZero++]);13 else {14 left++;15 right--;16 }17 }18 }19 };
Sort Colors
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。