sort-colors

package com.ytx.array;
/** 题目: 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.
                           click to show follow up.
                    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?
 *
 * @author yuantian xin
 *  
 *   元素取有限值为0,1,2的数组,这三个数分别分别代表红色,白色和蓝色。现在我们需要设计一个算法只需要一次遍历
 *   就可以把数组按0,1,2的顺序排好序。
 */
public class Sort_colors {
       
        public void sortColors(int[] A) {
             
            int i = -1;  //0的指针
           
            int j = -1; //1的指针
           
            int k = -1; //2的指针
           
            for(int index = 0; index < A.length; index++) {
              
               if(A[index] == 0) {
                    
                     A[++k] = 2;
                    
                     A[++j] = 1;
                    
                     A[++i] = 0;
                    
               } else if(A[index] == 1) {
                    
                     A[++k] = 2;
                    
                     A[++j] = 1;
                    
               } else if(A[index] == 2) {
                    
                     A[++k] = 2;
               }
              
            }
        }
       public static void main(String[] args) {
             int[] data={0,1,1,0,2,0,1,1,0,2,1};
             new Sort_colors().sortColors(data);
             
             for(int i = 0; i < data.length; i++) {
                    System.out.print(data[i] + " ");
             }
       }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值