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 integer 0
, 1
, and 2
to represent the color red, white, and blue respectively.
Notice
You are not supposed to use the library's sort function for this problem.
You should do it in-place (sort numbers in the original array).
Runtime: 82ms
1 class Solution{ 2 public: 3 /** 4 * @param nums: A list of integer which is 0, 1 or 2 5 * @return: nothing 6 */ 7 void sortColors(vector<int> &nums) { 8 // write your code here 9 if (nums.size() < 2) return; 10 11 int left = 0, right = nums.size() - 1; 12 int index = 0; 13 while (index <= right) { 14 if (nums[index] == 0) 15 swap(nums[index++], nums[left++]); 16 else if (nums[index] == 2) 17 swap(nums[index], nums[right--]); 18 else 19 index++; 20 } 21 } 22 };