解题思路:
注意事项:
参考代码:
package 练习; import java.util.*; public class Main { static Scanner sc = new Scanner(System.in); static int n = sc.nextInt(); static int count = 0; static ArrayList<Integer> ans = new ArrayList<>(); public static void main(String[] args) { // int[] north ={2,4,3,4}; // int[] west = {4,3,3,3}; int[] north = new int[n]; int[] west = new int[n]; for (int i = 0; i < north.length; i++) { north[i] = sc.nextInt(); } for (int i = 0; i < west.length; i++) { west[i] = sc.nextInt(); } int[][] map = new int[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { map[i][j] = count++; } } dfs(map, 0, 0, north, west); } private static void dfs(int[][] map, int x, int y, int[] north, int[] west) { boolean check = true; if (x >= n || y >= n || x < 0 || y < 0) { return; } for (int i = 0; i < n - 1; i++) { if (north[i] != 0 || west[i] != 0) { check = false; } } if (north[n - 1] != 1 || west[n - 1] != 1) { check = false; } for (int i = 0; i < n; i++) { if (north[i] < 0 || west[i] < 0) { return; } } if (x == n - 1 && y == n - 1 && check == false) { return; } if (x == n - 1 && y == n - 1 && check) { ans.add(map[x][y]); for (int i = 0; i < ans.size(); i++) { System.out.print(ans.get(i) + " "); } System.exit(0); } west[x]--; north[y]--; ans.add(map[x][y]); dfs(map, x, y + 1, north, west); dfs(map, x + 1, y, north, west); dfs(map, x - 1, y, north, west); dfs(map, x, y - 1, north, west); ans.remove(ans.size()-1); west[x]++; north[y]++; } }
0.0分
0 人评分
剪刀石头布 (C语言代码)不知道怎么直接在scanf中用枚举变量浏览:1315 |
简单的a+b (C语言代码)浏览:530 |
DNA (C语言描述,数据结构)浏览:855 |
WU-C语言程序设计教程(第三版)课后习题11.12 (C++代码)(想学链表的小伙伴可以看看)浏览:904 |
The 3n + 1 problem (C语言代码)浏览:553 |
1642题解浏览:715 |
printf基础练习2 (C语言代码)浏览:504 |
C语言程序设计教程(第三版)课后习题7.4 (C语言代码)浏览:489 |
盐水的故事 (C语言代码)浏览:1528 |
C语言程序设计教程(第三版)课后习题8.9 (C语言代码)浏览:508 |