Leetcode NO.75 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.

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?

本题其实就是3-way quicksort,算是经典算法了,至少我们那个很low的数据结构和算法课就讲了这个,当时确实不太懂,现在想想其实不难,代码确实老忘,但是记住核心思想就行:设定两个pointer,一个分割0,1,,另外一个pointer分割1,2,大致框架就是quicksort的框架,有一些小的细节需要处理。。如果确实不知道的朋友可以翻一下普林斯顿的那本算法红书,讲解的挺好的。。

然后详细代码如下:

class Solution {
public:
    void sortColors(int A[], int n) {
    	int red_back_pointer = 0;
    	int blue_fore_pointer = n - 1;
    	for (int i = 0; i <= blue_fore_pointer; ++i) {
    		if (A[i] == 0)
    			swap(A[i], A[red_back_pointer++]);
    		if (A[i] == 2)
    			swap(A[i--], A[blue_fore_pointer--]);		/* (i--), want to check that position again */
    	}
    }
};


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值