JAVA解数独

数独文件.txt

0 5 0 0 1 0 0 0 9
0 1 0 0 0 0 6 0 0
2 0 0 0 9 0 0 0 0
0 4 0 0 0 3 7 0 0
0 2 0 0 0 0 0 8 0
0 0 5 7 0 0 0 2 0
0 0 0 0 5 0 0 0 1
0 0 3 0 0 0 0 4 0
9 9 0 0 8 0 0 3 0

Main.java

import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        String arg = "F:\\LYJ\\shudu.txt";
        FileReader rd = new FileReader(arg);
        while (true) {
            Grid grid = Grid.create(rd);
            if (grid == null) {
                break;
            }
            List<Grid> solutions = new ArrayList<Grid>();
        }
    }

    private static void solve(Grid grid, List<Grid> solutions) {
        if (solutions.size() >= 2) {
            return;
        }
        int loc = grid.findEmptyCell();
        if (loc < 0) {
            solutions.add(grid.clone());
            return;
        }
        for (int n=1; n<10; n++) {
            if (grid.set(loc, n)) {
                solve(grid, solutions);
                grid.clear(loc);
            }
        }
    }

    private static void printSolutions(Grid grid, List<Grid> solutions) {
        System.out.println("原始数据");
        System.out.println(grid);
        if (solutions.size() == 0) {
            System.out.println("不可解");
        } else if (solutions.size() == 1) {
            System.out.println("结果");
        } else {
            System.out.println("至少有两个结果");
        }
        for (int i=0; i<solutions.size(); i++) {
            System.out.println(solutions.get(i));
        }
        System.out.println();
        System.out.println();
    }
}

Grid.java

import java.io.Reader;
public class Grid implements Cloneable {
    int[] cells = new int[81];
    int[] colsSet = new int[9];
    int[] rowsSet = new int[9];
    int[] subgridSet = new int[9];
    public static Grid create(Reader rd) throws Exception {
        Grid grid = new Grid();
        for (int loc=0; loc<grid.cells.length; ) {
            int ch = rd.read();
            if (ch < 0) {
                return null;
            }
            if (ch == '#') {
                while (ch >= 0 && ch != '\n' && ch != '\r') {
                    ch = rd.read();
                }
            } else if (ch >= '1' && ch <= '9') {
                grid.set(loc, ch-'0');
                loc++;
            } else if (ch == '.' || ch == '0') {
                loc++;
            }
        }
        return grid;
    }
    public int findEmptyCell() {
        for (int i=0; i<cells.length; i++) {
            if (cells[i] == 0) {
                return i;
            }
        }
        return -1;
    }
    public boolean set(int loc, int num) {
        int r = loc/9;
        int c = loc%9;
        int blockLoc = (r/3)*3+c/3;

        boolean canSet = cells[loc] == 0
                && (colsSet[c] & (1<<num)) == 0
                && (rowsSet[r] & (1<<num)) == 0
                && (subgridSet[blockLoc] & (1<<num)) == 0;
        if (!canSet) {
            return false;
        }

        cells[loc] = num;
        colsSet[c] |= (1<<num);
        rowsSet[r] |= (1<<num);
        subgridSet[blockLoc] |= (1<<num);
        return true;
    }

    public void clear(int loc) {
        // Compute row and column
        int r = loc/9;
        int c = loc%9;
        int blockLoc = (r/3)*3+c/3;

        int num = cells[loc];
        cells[loc] = 0;
        colsSet[c] ^= (1<<num);
        rowsSet[r] ^= (1<<num);
        subgridSet[blockLoc] ^= (1<<num);
    }
    public Grid clone() {
        Grid grid = new Grid();
        grid.cells = cells.clone();
        grid.colsSet = colsSet.clone();
        grid.rowsSet = rowsSet.clone();
        grid.subgridSet = subgridSet.clone();
        return grid;
    }
    public String toString() {
        StringBuffer buf = new StringBuffer();
        for (int r=0; r<9; r++) {
            if (r%3 == 0) {
                buf.append("-------------------------\n");
            }
            for (int c=0; c<9; c++) {
                if (c%3 == 0) {
                    buf.append("| ");
                }
                int num = cells[r*9+c];
                if (num == 0) {
                    buf.append(". ");
                } else {
                    buf.append(num+" ");
                }
            }
            buf.append("|\n");
        }
        buf.append("-------------------------");
        return buf.toString();
    }
}