python实现数独游戏 java简单实现数独游戏

作者:root__1024 时间:2022-10-18 00:46:29 

 使用python和java实现数独游戏,有比较才有收获哦。

1、Python版


#--coding:utf-8--

import random
import itertools
from copy import deepcopy

def 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 board

def 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 board

def 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 challange

Board = make_board()
print_board(Board)

效果:

python实现数独游戏 java简单实现数独游戏

2、Java版


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);
}
}

效果:


3 4 7 6 5 2 8 1 9
5 9 6 8 3 1 4 2 7
2 1 8 9 7 4 5 3 6
1 3 4 7 9 5 6 8 2
7 5 2 1 8 6 9 4 3
6 8 9 4 2 3 1 7 5
4 7 5 3 1 9 2 6 8
8 2 1 5 6 7 3 9 4
9 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

标签:python,java,数独
0
投稿

猜你喜欢

  • java控制台打印本月的日历

    2023-10-15 22:58:12
  • Java应用服务器之tomcat会话复制集群配置的示例详解

    2022-08-24 07:28:27
  • 详细解读Hibernate的缓存机制

    2023-05-03 21:02:52
  • JAVA 实现二叉树(链式存储结构)

    2022-02-18 11:35:21
  • Java图论进阶之最小生成树算法详解

    2022-05-28 12:17:54
  • Android提高之MediaPlayer音视频播放

    2021-05-29 08:44:37
  • C#获取所有进程的方法

    2022-06-13 16:02:24
  • C#画笔Pen绘制自定义线的帽子

    2022-01-09 20:33:55
  • Android自定义View实现竖直跑马灯效果案例解析

    2021-06-25 04:04:30
  • java为何不能多继承的原因详解

    2023-10-12 04:45:00
  • C语言 超详细总结讲解二叉树的概念与使用

    2023-11-08 20:24:56
  • WPF中使用CallerMemberName简化InotifyPropertyChanged的实现

    2023-05-08 16:27:07
  • C#中事务处理和非事务处理方法实例分析

    2023-12-23 08:09:13
  • Android Studio做超好玩的拼图游戏 附送详细注释源码

    2023-08-05 12:19:16
  • Mybatis 入参类型方式全面详解

    2023-10-16 20:03:40
  • C#定时器和随机数

    2023-10-28 15:30:34
  • Android巧用XListView实现万能下拉刷新控件

    2023-07-25 00:33:03
  • 深入讲解C#编程中嵌套类型和匿名类型的定义与使用

    2022-12-12 20:48:05
  • SpringBoot整合liquibase及liquibase生成初始化脚本的方式

    2023-07-29 11:53:18
  • Java Hibernate使用SessionFactory创建Session案例详解

    2022-03-04 06:21:28
  • asp之家 软件编程 m.aspxhome.com