zijiaw / sudoku Goto Github PK

int(*SudokuSolver::getSolution())[9]
{
    int(*p)[9] = new int[9][9];
    for (int i = 0; i < 9; ++i)
    {
        for (int j = 0; j < 9; ++j)
        {
            p[i][j] = problem[i][j];
        }
    }
    return p;
}

vector<int(*)[9]> SudokuInput(char * filename)
{
    ifstream file;
    file.open(filename, ios::in);
    int linenum = 0, curline = 0;
    vector<int(*)[9]> ProblemSet;
    int(*temp)[9] = new int[9][9];
    if (!file.is_open())
    {
        cerr << "fail to open file!" << endl;
        return ProblemSet;
    }
    while (!file.eof())
    {
        string buffer;
        getline(file, buffer);
        if (buffer.empty())
            continue;
        linenum++;
        if (linenum % 9 == 1)
        {
            temp = new int[9][9];
            curline = 0;
        }
        for (int i = 0; i < 9; ++i)
        {
            temp[curline][i] = buffer[2 * i] - '0';
        }
        curline++;
        if (linenum % 9 == 0)
        {
            ProblemSet.push_back(temp);
            temp = NULL;
        }
    }
    file.close();
    return ProblemSet;
}

void SudokuOutput(char *ret, int maxnum, char *ret2);

 char *result = new char[1000000 * 81 + 1];
 char *q = new char[1000000 * (81 * 2 + 1)];

class SudokuSolve {
public:
	bool Solve(int r, int l);//递归填数
	bool check(int r, int l, int num);//测试同行同宫同列是否已有num
	void ProblemInit(int p[9][9]);//初始化
    int(*getSolution())[9];//返回解
private:
	int problem[9][9];
};

class SudokuMaker {
public:
    bool fill(int r, int l, char *ret);//递归填数
    bool check(int r, int l, int num);//判断在[r,l]处放入num是否符合数独规则
    void RequestInit(int n);//初始化需求
private:
    int maxnum;//需要生成的数独终局数
    int count;//当前已生成的数独终局数
    int M[9][9];//维护的数独棋盘
};