[Leetcode] Sort Colors (C++)
题目:
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?
1 class Solution { 2 public: 3 void sortColors(int A[], int n) { 4 int i = -1; 5 int j = -1; 6 for (int p = 0; p < n; p++) { 7 if (A[p] == 2) { 8 // do nothing but moving the index of k 9 } else if (A[p] == 1) { 10 // 11 A[p] = 2; 12 A[++j] = 1; 13 } else { 14 A[p] = 2; 15 A[++j] = 1; 16 A[++i] = 0; 17 } 18 } 19 } 20 };
郑重声明:本站内容如果来自互联网及其他传播媒体,其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享,并不代表本站赞同其观点和对其真实性负责,也不构成任何其他建议。