Java 二维数组双色球随机数生成与频率统计

2. 排序验证

对生成的号码进行排序以便检查。注意此处为特定场景下的排序逻辑，非通用选择排序。

private static int[] selectionSort(int[] arr) {
    for (int i = 0; i < arr.length - 3; i++) {
        int index = i;
        for (int j = i + 1; j < arr.length - 2; j++) {
            if (arr[j] < arr[index]) {
                index = j;
            }
        }
        int tmp = arr[index];
        arr[index] = arr[i];
        arr[i] = tmp;
    }
    if (arr[arr.length - 2] > arr[arr.length - 1]) {
        int temp = 0;
        temp = arr[arr.length - 1];
        arr[arr.length - 1] = arr[arr.length - 2];
        arr[arr.length - 2] = temp;
    }
    return arr;
}

3. 频率统计

利用两个二维数组分别统计 1-32 和 1-16 范围内数字的出现次数。第一维存储数字本身，第二维存储频次。

for (int i = 0; i < store32[0].length; i++) {
    store32[0][i] = i + 1;
}
for (int i = 0; i < arra.length; i++) {
    for (int j = 0; j < 5; j++) {
        for (int k = 0; k < store32[0].length; k++) {
            if (arra[i][j] == store32[0][k]) {
                store32[1][k] += 1;
            }
        }
    }
}
// 蓝球部分逻辑类似

4. 筛选最少出现数字

通过嵌套循环遍历，优先选取出现次数为 0 的数字，逐步构建最终号码组合。

while (true) {
    for (int i = 0; i < store32[0].length; i++) {
        if (store32[1][i] == a) {
            output[b] = store32[0][i];
            b += 1;
        }
        if (b == 5) {
            break;
        }
    }
    a += 1;
    if (b == 5) {
        break;
    }
}

完整代码实现

import java.util.*;

public class lotterySimulator {
    public static int[][] generator(int a, int b) {
        int[][] arr = new int[a][b];
        Random random = new Random();
        int c = 0;
        for (int i = 0; i < arr.length; i++) {
            for (int j = 0; j < arr[i].length; j++) {
                while (true) {
                    c = j == 5 || j == 6 ? random.nextInt(15) + 1 : random.nextInt(31) + 1;
                    if (!contains(c, arr[i])) {
                        break;
                    }
                }
                arr[i][j] = c;
            }
        }
        return arr;
    }

    public static boolean contains(int a, int[] sss) {
        boolean result = false;
        for (int er : sss) {
            result = er == a ? true : false;
            if (result) {
                break;
            }
        }
        return result;
    }

    private static int[] selectionSort(int[] arr) {
        for (int i = 0; i < arr.length - 3; i++) {
            int index = i;
            for (int j = i + 1; j < arr.length - 2; j++) {
                if (arr[j] < arr[index]) {
                    index = j;
                }
            }
            int tmp = arr[index];
            arr[index] = arr[i];
            arr[i] = tmp;
        }
        if (arr[arr.length - 2] > arr[arr.length - 1]) {
            int temp = 0;
            temp = arr[arr.length - 1];
            arr[arr.length - 1] = arr[arr.length - 2];
            arr[arr.length - 2] = temp;
        }
        return arr;
    }

    public static void main(String[] args) {
        int[][] arra = generator(10, 7);
        int[][] store32 = new int[2][32];
        int[][] store16 = new int[2][16];
        int[] output = new int[7];

        for (int i = 0; i < arra.length; i++) {
            selectionSort(arra[i]);
        }

        for (int[] a : arra) {
            for (int b : a) {
                System.out.print(b + (b == a[a.length - 1] ? "\n" : ","));
            }
        }

        for (int i = 0; i < store32[0].length; i++) {
            store32[0][i] = i + 1;
        }
        for (int i = 0; i < store16[0].length; i++) {
            store16[0][i] = i + 1;
        }

        for (int i = 0; i < arra.length; i++) {
            for (int j = 0; j < 5; j++) {
                for (int k = 0; k < store32[0].length; k++) {
                    if (arra[i][j] == store32[0][k]) {
                        store32[1][k] += 1;
                    }
                }
            }
        }

        for (int i = 0; i < arra.length; i++) {
            for (int j = 5; j < 7; j++) {
                for (int k = 0; k < store16[0].length; k++) {
                    if (arra[i][j] == store16[0][k]) {
                        store16[1][k] += 1;
                    }
                }
            }
        }

        int a = 0;
        int b = 0;
        while (true) {
            for (int i = 0; i < store32[0].length; i++) {
                if (store32[1][i] == a) {
                    output[b] = store32[0][i];
                    b += 1;
                }
                if (b == 5) {
                    break;
                }
            }
            a += 1;
            if (b == 5) {
                break;
            }
        }

        a = 0;
        b = 5;
        while (true) {
            for (int i = 0; i < store16[0].length; i++) {
                if (store16[1][i] == a && !contains(store16[0][i], output)) {
                    output[b] = store16[0][i];
                    b += 1;
                }
                if (b == 7) {
                    break;
                }
            }
            a += 1;
            if (b == 7) {
                break;
            }
        }

        for (int x : output) {
            System.out.print(x == output[output.length - 1] ? x : x + ",");
        }
    }
}

运行结果

自动生成示例： 6,11,15,21,22,1,14 10,22,25,28,29,4,14 ...

最终筛选结果：8,13,20,30,32,2,7