1、Python版
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
#--coding:utf-8--import randomimport itertoolsfrom copy import deepcopydef make_board(m=3): numbers = list(range(1,m**2+1)) #可能出现的数字为1-9 board = None #board是数度二维列表 while board is None: board = get_board(m,numbers) return boarddef get_board(m,numbers): n = m**2 board = [[None for _ in range(n)] for _ in range(n)] for i,j in itertools.product(range(n),repeat=2): i0,j0 = i-i%m,j-j%m # i,j分别代表的是我们的行和列 # i0和j0代表的是board[i][j]所在的区块的起始位置 random.shuffle(numbers) #shuffle() 方法将序列的所有元素随机排序。 for x in numbers: if(x not in board[i] and all(row[j]!=x for row in board) and all(x not in row[j0:j0+m] for row in board[i0:i])): board[i][j] = x break else:#当循环正常结束时会执行else return None return boarddef print_board(board,m=3): numbers = list(range(1,m**2+1)) #每一行随机把5个数字变成None omit = 5 #omit变量掌控着每一行被抹去的数字个数 challange = deepcopy(board) for i,j in itertools.product(range(omit),range(m**2)): x = random.choice(numbers) - 1 challange[x][j] = None spacer = "++-----+-----+-----++-----+-----+-----++-----+-----+-----++" print(spacer.replace('-','=')) for i,line in enumerate(challange): print("|| {} | {} | {} || {} | {} | {} || {} | {} | {} ||" .format(*(cell or ' ' for cell in line))) #format()函数中的 * 号，则是将所有的 cell 的不同值放入一个元组 tuple 之中，方便format函数调用 if(i+1)%3==0: print(spacer.replace('-','=')) else: print(spacer) return challangeBoard = make_board()print_board(Board) |
效果：
2、Java版
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
|
package com.jimo;import java.util.ArrayList;import java.util.Collections;import java.util.List;import java.util.Random;public class Shudu { public String[][] make_board(int m) { String[][] board = null; int n = m * m; List<Integer> numbers = new ArrayList<>(); for (int i = 1; i <= n; i++) { numbers.add(i); } while (board == null) { board = get_board(m, numbers); } return board; } private String[][] get_board(int m, List<Integer> numbers) { int n = m * m; String[][] board = new String[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { boolean ok = true; // 打乱顺序 Collections.shuffle(numbers); for (int x = 0; x < n; x++) { if (isOk(numbers.get(x) + "", board, i, j, m)) { board[i][j] = numbers.get(x) + ""; ok = false; break; } } if (ok) { return null; } } } return board; } public void print_board(String[][] board, int m) { int n = m * m; int hard = 5; String[][] b = new String[n][n]; System.arraycopy(board, 0, b, 0, board.length); Random rd = new Random(); for (int i = 0; i < hard; i++) { for (int j = 0; j < n; j++) { int x = rd.nextInt(9); b[x][j] = null; } } String spacer = "+-----+-----+-----+-----+-----+-----+-----+-----+-----+"; System.out.println(spacer); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (null == board[i][j]) { System.out.print("| |"); } else { System.out.print("| " + b[i][j] + " |"); } } System.out.println(); System.out.println(spacer); } } /** * 判断行列和9格里是否重复 * * @param x * @param board * @return */ private boolean isOk(String x, String[][] board, int i, int j, int m) { int i0 = i - i % m, j0 = j - j % m; int n = m * m; for (int k = 0; k < n; k++) { if (x.equals(board[i][k]) || x.equals(board[k][j])) { return false; } } for (int k = i0; k < i; k++) { for (int g = j0; g < j0 + m; g++) { if (board[k][g].equals(x)) { return false; } } } return true; } public static void main(String[] args) { Shudu s = new Shudu(); int m = 3; String[][] b = s.make_board(m); for (int i = 0; i < 9; i++) { for (int j = 0; j < 9; j++) { System.out.print(b[i][j] + " "); } System.out.println(); } s.print_board(b, m); }} |
效果：
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
|
3 4 7 6 5 2 8 1 95 9 6 8 3 1 4 2 72 1 8 9 7 4 5 3 61 3 4 7 9 5 6 8 27 5 2 1 8 6 9 4 36 8 9 4 2 3 1 7 54 7 5 3 1 9 2 6 88 2 1 5 6 7 3 9 49 6 3 2 4 8 7 5 1+-----+-----+-----+-----+-----+-----+-----+-----+-----+| || || || 6 || 5 || || 8 || 1 || 9 |+-----+-----+-----+-----+-----+-----+-----+-----+-----+| 5 || 9 || 6 || || || || 4 || || 7 |+-----+-----+-----+-----+-----+-----+-----+-----+-----+| 2 || || || 9 || 7 || 4 || 5 || || 6 |+-----+-----+-----+-----+-----+-----+-----+-----+-----+| 1 || 3 || 4 || 7 || 9 || || 6 || || |+-----+-----+-----+-----+-----+-----+-----+-----+-----+| || 5 || 2 || 1 || || || || 4 || |+-----+-----+-----+-----+-----+-----+-----+-----+-----+| || || || || 2 || 3 || || 7 || |+-----+-----+-----+-----+-----+-----+-----+-----+-----+| 4 || 7 || || || 1 || 9 || || 6 || 8 |+-----+-----+-----+-----+-----+-----+-----+-----+-----+| || 2 || 1 || 5 || 6 || 7 || || || 4 |+-----+-----+-----+-----+-----+-----+-----+-----+-----+| 9 || 6 || || || || || || 5 || 1 |+-----+-----+-----+-----+-----+-----+-----+-----+-----+ |
可以看出java的代码量是python的两倍。
以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持服务器之家。
原文链接：https://blog.csdn.net/jimo_lonely/article/details/54707918
