【LeetCode OJ 075】Sort Colors

原创于 2016-03-27 12:59:55 发布 · 951 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode

LeetCode 同时被 2 个专栏收录

43 篇文章

订阅专栏

LeetCode题解

41 篇文章

订阅专栏

本文详细阐述了排序算法的基本概念，介绍了三种常见的排序方法，并通过示例代码展示了如何使用这些算法对不同颜色的对象进行排序。

题目链接：https://leetcode.com/problems/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.

解题思路如下：遍历数组，存储每种颜色的个数，再进行排序，示例代码如下：

/**
 * @Description:
 * 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.
 * @author 徐剑   
 * @date 2016年3月27日 下午12:32:14 
 * @version V1.0
 */
public class Solution
{	
	 public static void sortColors(int[] nums)
	 {
	        if(nums==null||nums.length<=0)
	        	return;
	        int a[]=new int[3];
	        for(int i=0;i<nums.length;i++)
	        {
	        	a[nums[i]]++;
	        }
	        int x=0;
	        int y=0;
	        int z=0;
	        for(int i=0;i<nums.length;)
	        {
	        	while(x<a[0])
	        	{
	        		x++;
	        		nums[i]=0;
	        		i++;
	        		continue;
	        	}
	        	while(y<a[1])
	        	{
	        		y++;
	        		nums[i]=1;
	        		i++;
	        		continue;
	        	}
	        	while(z<a[2])
	        	{
	        		z++;
	        		nums[i]=2;
	        		i++;
	        		continue;
	        	}
	        }
	 }
}