编程之美1.15构造数独---置换法java版

最新推荐文章于 2021-07-02 06:55:04 发布

哒宝甜

最新推荐文章于 2021-07-02 06:55:04 发布

阅读量454

点赞数

分类专栏：编程之美笔记

本文链接：https://blog.csdn.net/TT285955925/article/details/51549427

版权

编程之美笔记专栏收录该内容

28 篇文章 0 订阅

订阅专栏

脑筋急转弯一样的东西。。。

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
package Test;

/**
 *
 * @author Administrator
 */
public class SudokuDisplace {

    public static void main(String[] args) {
        int[][] shudu = new int[9][9];
        int[][] arr = {{3, 5, 8}, {7, 9, 4}, {1, 6, 2}};
        for (int i = 0; i < 9; i++) {
            for (int j = 0; j < 9; j++) {
                shudu[i][j] = 0;
            }
        }
        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < 3; j++) {
                shudu[i + 3][j + 3] = arr[i][j];
            }
        }
        //置换行
        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < 3; j++) {
                if (i == 0) {
                    shudu[i + 3][j] =shudu[i+5][j+3];
                    shudu[i + 3][j + 6] = shudu[i+4][j+3];
                }

                if (i == 1) {
                    shudu[i + 3][j] = shudu[i+2][j+3];
                    shudu[i + 3][j + 6] = shudu[i+4][j+3];
                }

                if (i == 2) {
                    shudu[i + 3][j] = shudu[i+2][j+3];
                    shudu[i + 3][j + 6] = shudu[i+1][j+3];
                }

            }
        }
        //置换列
        for(int i=0;i<3;i++){
            for(int j =0;j<3;j++){
                if(j ==0){
                    shudu[i][j + 3] = shudu[i+3][j+5];
                    shudu[i + 6][j + 3] = shudu[i+3][j+4];
                    shudu[i][j]=shudu[i+3][j+2];
                    shudu[i+6][j]=shudu[i+3][j+1];
                    shudu[i][j+6]=shudu[i+3][j+8];
                    shudu[i+6][j+6]=shudu[i+3][j+7];
                }
                if (j == 1) {
                    shudu[i][j + 3] = shudu[i+3][j+2];
                    shudu[i + 6][j + 3] = shudu[i+3][j+4];
                    shudu[i][j] = shudu[i+3][j-1];
                    shudu[i+6][j]=shudu[i+3][j+1];
                    shudu[i][j+6]=shudu[i+3][j+5];
                    shudu[i+6][j+6]=shudu[i+3][j+7];
                }
                if (j == 2) {
                    shudu[i][j + 3] = shudu[i+3][j+2];
                    shudu[i + 6][j + 3] = shudu[i+3][j+1];
                    shudu[i][j] = shudu[i+3][j-1];
                    shudu[i+6][j]=shudu[i+3][j-2];
                    shudu[i][j+6]=shudu[i+3][j+5];
                    shudu[i+6][j+6]=shudu[i+3][j+4];
                }
            }
        }
        for (int i = 0; i < 9; i++) {
            for (int j = 0; j < 9; j++) {
                if (j != 8) {
                    System.out.print(shudu[i][j] + "    ");
                } else {
                    System.out.println(shudu[i][j]);
                }

            }
        }
    }

}