蓝桥杯DFS水题（java）填入0~9的数字。要求：连续的两个数字不能相邻

输出:有多少种填入方式

用暴力DFS写的，反正数据量很小

import java.util.Scanner;
import java.util.Vector;

public class Main {
   
	public static int[][] m = new int[3][4];
	public static int[] pack = {
   0,1,2,3,4,5,6,7,8,9}; 
	public static int[] visited = new int[10];
	public static int sum = 0;
	public static int solve() {
   
		int ok=1;
		int index = 0;
		for(int i=0;i<3;i++) {
   
			for(int j=0;j<4;j++) {
   
				if(m[i][j]==-2)continue;
				m[i][j] = pac