leetcode 075 Sort Colors

来源：互联网发布：邱一平麟龙软件破解版编辑：程序博客网时间：2024/05/22 12:55

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.

设置三个指针，cur指针用于遍历数组，begin指针指向第一个1所在的位置，end指针指向第一个2所在的位置。那么指针begin之前的数字都是0，指针

begin与指针end之间的数字都是1，指针end之后的数字都是2.

class Solution {public:void sortColors(vector<int> &nums) {int len = nums.size();if(len == 0) return;int begin = 0, cur = 0, end = len-1, temp;for(; cur < end; ) {if(nums[cur]==0) {temp = nums[cur];nums[cur] = nums[begin];nums[begin] = temp;begin++;cur++;} else if(nums[cur]==1) {cur++;} else if(nums[cur]==2) {temp = nums[end];nums[end] = nums[cur];nums[cur] = temp;end--;}}}}

0 0