寻找规律数字：将1，2，…，9共9个数分成三组，分别组成三个三位数，且使这三个三位数构成1：2：3的比例，试求出所有满足条件的三个三位数的组数。

public class Main {
    public static int count = 0;

    public static void main(String[] args) {
        int[] nums = {1, 2, 3, 4, 5, 6, 7, 8, 9};
        int[] group1 = new int[3];
        int[] group2 = new int[3];
        int[] group3 = new int[3];
        boolean[] used = new boolean[9];

        findCombinations(nums, group1, group2, group3, used, 0);

        System.out.println(count);
    }

    public static void findCombinations(int[] nums, int[] group1, int[] group2, int[] group3, boolean[] used, int index) {
        if (index == 9) { // 所有数字都已经分组完毕
            int num1 = group1[0] * 100 + group1[1] * 10 + group1[2];
            int num2 = group2[0] * 100 + group2[1] * 10 + group2[2];
            int num3 = group3[0] * 100 + group3[1] * 10 + group3[2];
            if (num2 == 2 * num1 && num3 == 3 * num1) {
                count++;
            }
            return;
        }

        for (int i = 0; i < 9; i++) {
            if (!used[i]) {
                used[i] = true;
                if (index < 3) {
                    group1[index] = nums[i];
                } else if (index < 6) {
                    group2[index - 3] = nums[i];
                } else {
                    group3[index - 6] = nums[i];
                }
                findCombinations(nums, group1, group2, group3, used, index + 1);
                used[i] = false;
            }
        }
    }
}