递归-回溯-k进制串

public class KString {
    private static final int n = 4;
    private static final int[] array = new int[n];

    public static void kString(int n, int k) {
        if (n < 1) {
            System.out.println(Arrays.toString(array));
        } else {
            for (int i = 0; i < k; i++) {
                array[n - 1] = i;
                kString(n - 1, k);
            }
        }
    }

    public static void main(String[] args) {
        kString(n,3);
    }
}