zoukankan      html  css  js  c++  java
  • 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 over write 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?

     

            思路:注意题目的要求是一次遍历。代码如下:

    void swap(int *a, int *b)
    {
    	int tmp;
    	tmp = *b;
    	*b = *a;
    	*a = tmp;
    }
    
    void sortColors(int* nums, int numsSize) 
    {
    	int start1 = 0, end1 = numsSize-1;
    	int i;
    
    	while(start1 <= end1 && nums[start1] == 0)start1++;
    	while(end1 >= start1 && nums[end1] == 2)end1 --;
    
    	for(i = start1; i <= end1; )
    	{
    		if(nums[i] == 0)
    		{
    			swap(nums+i, nums+start1);
    			while(start1 <= end1 && nums[start1] == 0)start1++;
    			i = start1;
    		}
    		else if(nums[i] == 2)
    		{
    			swap(nums+i, nums+end1);
    			while(end1 >= start1 && nums[end1] == 2)end1 --;
    		}
    		else
    		{
    			i++;
    		}
    	}
    }
    
    void sortColors2(int* nums, int numsSize) 
    {
    	int start1 = 0, end1 = numsSize-1;
    	int i;
    
    	for(i = start1; i <= end1; i++)
    	{
    		if(nums[i] == 0)
    		{
    			swap(nums+i, nums+start1);
    			start1++;
    		}
    		if(nums[i] == 2)
    		{
    			swap(nums+i, nums+end1);
    			end1--;
    			i--;
    		}
    	}
    }


     

    参考:

    https://github.com/haoel/leetcode/blob/master/algorithms/sortColors/sortColors.cpp

  • 相关阅读:
    计算机网络
    git学习总结
    MySQL性能优化的21条最佳经验【转】
    为什么Laravel是最成功的PHP框架?
    分布式集群系统下的高可用session解决方案
    浏览器中输入URL到返回页面的全过程
    真正的inotify+rsync实时同步 彻底告别同步慢
    memcache中的add和set方法区别
    php 接口 implements 使用
    Redis的PHP操作手册(自用)
  • 原文地址:https://www.cnblogs.com/gqtcgq/p/7247117.html
Copyright © 2011-2022 走看看