LeetCode 75. Sort Colors (O(n) one pass实现)

最新推荐文章于 2022-12-30 11:28:20 发布

stephen_wong

最新推荐文章于 2022-12-30 11:28:20 发布

阅读量750

点赞数

分类专栏： LeetCode LeetCode Problems 文章标签： LeetCode C++

本文链接：https://blog.csdn.net/stephen_wong/article/details/37794229

版权

LeetCode 同时被 2 个专栏收录

186 篇文章 0 订阅

订阅专栏

LeetCode Problems

183 篇文章 2 订阅

订阅专栏

代码：

class Solution 
{
public:
    void sortColors(int A[], int n) 
    {
        int red=0, white=0;
        for (int i = 0; i < n; ++ i)
        {
        	if (A[i] == WHITE)
        	{
        		A[i] = BLUE;
        		A[white ++] = WHITE;
        	} else if (A[i] == RED)
        	{
        		A[i] = BLUE;
        		A[white ++] = WHITE;
        		A[red ++] = RED;
        	}
        }
    }
private:
	const int RED = 0;
	const int WHITE = 1;
	const int BLUE = 2;
};