57uv6Z6g55qE5Y2a5a6i

MS4wLjABAAAA5qMD8Gzdcgq7HXUOviKB59i0-ybJ59jJvNzyaPt5XOsVNqP6DU7WLcoAXvdxvYdp💗
本站所有文章仅作技术研究，请勿非法破坏，请遵守相关法律法规，后果自负

【代码】Java实现计数排序

发表于 2025-12-08 更新于 2025-12-26 阅读次数：

前言

Java实现计数排序

正序

void sortASC(int[] nums) {
    int maxValue = nums[0];
    int minValue = nums[0];
    for (int num : nums) {
        maxValue = Math.max(maxValue, num);
        minValue = Math.min(minValue, num);
    }
    int offset = 0;
    if (minValue < 0) {
        offset = -minValue;
        maxValue = maxValue + offset;
        for (int i = 0; i < nums.length; i++) {
            nums[i] = nums[i] + offset;
        }
    }
    int[] count = new int[maxValue + 1];
    for (int num : nums) {
        count[num]++;
    }
    int[] result = new int[nums.length];
    int resultIndex = 0;
    for (int i = 0; i < count.length; i++) {
        for (int j = 0; j < count[i]; j++) {
            result[resultIndex++] = i - offset;
        }
    }
    System.arraycopy(result, 0, nums, 0, nums.length);
}

倒序

void sortDESC(int[] nums) {
    int maxValue = nums[0];
    int minValue = nums[0];
    for (int num : nums) {
        maxValue = Math.max(maxValue, num);
        minValue = Math.min(minValue, num);
    }
    int offset = 0;
    if (minValue < 0) {
        offset = -minValue;
        maxValue = maxValue + offset;
        for (int i = 0; i < nums.length; i++) {
            nums[i] = nums[i] + offset;
        }
    }
    int[] count = new int[maxValue + 1];
    for (int num : nums) {
        count[num]++;
    }
    int[] result = new int[nums.length];
    int resultIndex = 0;
    for (int i = count.length - 1; i >= 0; i--) {
        for (int j = 0; j < count[i]; j++) {
            result[resultIndex++] = i - offset;
        }
    }
    System.arraycopy(result, 0, nums, 0, nums.length);
}

完成

0%