第一次在csdn上发博文,好紧张啊。
上下班很无聊的,在地铁上挤得像沙丁鱼一样,看电视剧不是我的爱好,只能玩玩数独打发时间了,
最近手机上的数独游戏玩到中级了,关卡好难啊,怎么都过不去。
今天正好有时间,写了一个简单的算法解一下数独。
什么是算法?解决某种问题的方法,有输入和输出,还有一定的步骤,
其实吃法也是一种算法,难道不是吗?
下面贴一下代码,自己试了一下,只能解决简单的关卡,中级的关卡解不出来,后续我会继续优化,也欢迎各位拍砖。
import java.util.HashSet;
import java.util.Set;
public class CalSodu {
public static void main(String[] args) {
int[][] question = {
{ 7, 0, 0, 0, 0, 0, 0, 0, 4 },
{ 0, 2, 0, 0, 0, 9, 0, 0, 0 },
{ 8, 0, 6, 3, 0, 4, 0, 0, 5 },
{ 0, 0, 7, 0, 3, 5, 0, 0, 0 },
{ 5, 0, 0, 0, 0, 0, 0, 0, 8 },
{ 0, 0, 0, 6, 7, 0, 4, 0, 0 },
{ 4, 0, 0, 9, 0, 3, 2, 0, 1 },
{ 0, 0, 0, 5, 0, 0, 0, 3, 0 },
{ 9, 0, 0, 0, 0, 0, 0, 0, 6 } };
int count = 0;
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
if (question[i][j] == 0) {
count++;
}
}
}
for (int i = 0; i < count; i++) {
String ret = getOne(question);
System.out.println(i + 1 + "\t:\t" + ret);
}
}
private static String getOne(int[][] question) {
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
int q = question[i][j];
if (q != 0) {
continue;
}
Set<Integer> s = getSet();
for (int k = 0; k < 9; k++) {
int tmp = question[i][k];
if (tmp != 0) {
s.remove(tmp);
}
tmp = question[k][j];
if (tmp != 0) {
s.remove(tmp);
}
}
int startx = (i / 3) * 3;
int starty = (j / 3) * 3;
for (int m = startx; m < startx + 3; m++) {
for (int n = starty; n < starty + 3; n++) {
int tmp = question[m][n];
if (tmp != 0) {
s.remove(tmp);
}
}
}
if (s.size() == 1) {
for (int core : s) {
String str = "[" + (i + 1) + "][" + (j + 1) + "]=" + core;
// System.out.println(str);
question[i][j] = core;
return str;
}
}
}
}
return "";
}
private static Set<Integer> getSet() {
Set<Integer> s = new HashSet<Integer>();
for (int i = 1; i < 10; i++) {
s.add(i);
}
return s;
}
}