java树图的基础（递归含递归案例代码）

案例：迷宫格

 

package mazeApp;

public class MazeApp {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[][] map = new int[8][7];
		
		for(int i = 0; i < 7; i++) {
			map[0][i] = 1;
			map[7][i] = 1;
		}
		
		for(int i = 0; i < 8; i++) {
			map[i][0] = 1;
			map[i][6] = 1;
		}
		
		map[3][1] = 1;
		map[3][2] = 1;
		
		//迷宫
		System.out.println("迷宫");
		for(int i = 0; i < 8; i++) {
			for(int j = 0; j < 7; j++) {
				System.out.print(map[i][j] + " ");
			}
			System.out.println();
		}
		isRun(map, 1, 1);
		System.out.println("小球走的路径");
		for(int i = 0; i < 8; i++) {
			for(int j = 0; j < 7; j++) {
				System.out.print(map[i][j] + " ");
			}
			System.out.println();
		}

	}
	public static boolean isRun(int[][] map, int i, int j) {
		if(map[6][5] == 2) {
			return true;
		}else {
			if(map[i][j] == 0) {
				map[i][j] = 2;
				if(isRun(map, i + 1, j)) {
					return true;
				}else if(isRun(map, i, j+1)) {
					return true;
				}else if(isRun(map, i - 1, j)) {
					return true;
				}else if(isRun(map, i, j - 1)) {
					return true;
				}else {
					map[i][j] = 3;
					return false;
				}
			}else {
				return false;
				}
			}
	}

}