非比较排序之桶排序(bucket sort)

最新推荐文章于 2024-08-29 16:22:34 发布

katrina95

最新推荐文章于 2024-08-29 16:22:34 发布

阅读量210

点赞数

分类专栏：计算机算法文章标签： leetcode java

本文链接：https://blog.csdn.net/katrina95/article/details/79157375

版权

计算机算法专栏收录该内容

221 篇文章 0 订阅

订阅专栏

1. 桶排序

如果输入的数组里没有重复，那么一个普通数组就可以，这个数组的大小为原数组中的max - min + 1。代码如下。

public static int[] bucketSort(int[] nums) {
        if (nums.length <= 1) return nums;
        int min = Integer.MAX_VALUE, max = Integer.MIN_VALUE;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] > max) max= nums[i];
            if (nums[i] < min) min = nums[i];
        }
        int[] bucket = new int[max - min + 1];
        for (int i = 0; i < nums.length; i++) {
            bucket[nums[i] - min]++;
        }
        int[] result = new int[nums.length];
        int index = 0;
        for (int i = 0; i < bucket.length; i++) {
            while (bucket[i] > 0) {
                result[index++] = i + min;
                bucket[i]--;
            }
        }
        return result;
    }

public static int[] bucketSort(int[] nums) {
        if (nums.length <= 1) return nums;
        int min = Integer.MAX_VALUE, max = Integer.MIN_VALUE;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] > max) max= nums[i];
            if (nums[i] < min) min = nums[i];
        }
        List[] bucket = new List[max - min + 1];
        for (int i = 0; i < nums.length; i++) {
            if (bucket[nums[i] - min] == null) {
                bucket[nums[i] - min] = new ArrayList<Integer>();
            }
            List<Integer> list = bucket[nums[i] - min];
            list.add(i);
            bucket[nums[i] - min] = list;
        }
        int[] result = new int[nums.length];
        int index = 0;
        for (int i = 0; i < bucket.length; i++) {
            if (bucket[i] != null) {
                for (int j = 0; j < bucket[i].size(); j++) {
                    int temp = (Integer) bucket[i].get(j);
                    result[index++] = nums[temp];
                }
            }
        }
        return result;
    }

public static int[] bucketSort(int[] nums) {
        if (nums.length <= 1) return nums;
        int min = Integer.MAX_VALUE, max = Integer.MIN_VALUE;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] > max) max= nums[i];
            if (nums[i] < min) min = nums[i];
        }
        List[] bucket = new List[max - min + 1];
        for (int i = 0; i < nums.length; i++) {
            if (bucket[nums[i] - min] == null) {
                bucket[nums[i] - min] = new ArrayList<Integer>();
            }
            List<Integer> list = bucket[nums[i] - min];
            list.add(i);
            bucket[nums[i] - min] = list;
        }
        int[] result = new int[nums.length];
        int index = 0;
        for (int i = 0; i < bucket.length; i++) {
            if (bucket[i] != null) {
                for (int j = 0; j < bucket[i].size(); j++) {
                    int temp = (Integer) bucket[i].get(j);
                    result[index++] = nums[temp];
                }
            }
        }
        return result;
    }