Detailed tutorial on implementing Jiugongge in Java

This article mainly introduces relevant information about a simple example of implementing Jiugongge in Java. Friends who need it can refer to it

A simple example of implementing Jiugongge in Java

九公格: There are three rows, three columns and nine grids. A total of nine numbers from 1 to 9 are filled in these nine grids without repetition. The condition is that the sum of the three numbers in each row, each column and two diagonals is equal.

The following uses Java to implement Jiugongge:

public class NineTable {
  public static void main(String[] args) {
    int arr[][] = new int[3][3];
    int a = 2;
    int b = 3 / 2;
    for (int i = 1; i <= 9; i++) {
      arr[a++][b++] = i;
      if (0 == i % 3) {
        a = a - 2;
        b = b - 1;
      }
      else {
        a = a % 3;
        b = b % 3;
      }
    }
    System.out.println("output:");
    for (int i = 0; i < 3; i++) {
      for (int j = 0; j < 3; j++) {
        System.out.print(arr[i][j] + " ");
      }
      System.out.print("\n");
    }
  }
}

Running on Linux:

$javac NineTable.java
$java NineTable
output:
4 9 2 
3 5 7 
8 1 6

The above is the detailed content of Detailed tutorial on implementing Jiugongge in Java. For more information, please follow other related articles on the PHP Chinese website!