Java实现桶排序

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/jal517486222/article/details/86497032
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        int n = cin.nextInt();
        int max = 10000;
        int x;
        int []count = new int[max+1];
        Arrays.fill(count, 0);
        for (int i = 0; i < n; i++){
            x = cin.nextInt();
            count[x]++;
        }
        boolean flag = false;
        for (int i = 0; i <= max; i++){
            while (count[i] > 0){
                if (!flag){
                    System.out.print(i);
                    flag = true;
                }else {
                    System.out.print( " " + i);
                }
                count[i]--;
            }
        }
        System.out.println();
    }
}

猜你喜欢

转载自blog.csdn.net/jal517486222/article/details/86497032
今日推荐