JAVA "magic square"判定算法的实现。

最新推荐文章于 2025-07-29 00:53:05 发布

原创

最新推荐文章于 2025-07-29 00:53:05 发布 · 1.7k 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #JAVA #magic square

该博客介绍了如何使用JAVA编程实现魔法方阵的判定。魔法方阵是一种n×n的矩阵，其中填入1到n²的数字，使得每一行、每一列以及两条对角线上的数字之和相等。博客提供了输入矩阵数值并检查是否符合魔法方阵条件的代码，包括检查输入数量、确保所有数字出现一次以及计算和比较行、列和对角线的和。

package com.qiqi;

import java.util.Scanner;

/**
 * 
 * Magic squares. An n*n matrix that is filled with the numbers 1, 2, 3, . . . , n2 is a
 * magic square if the sum of the elements in each row, in each column, and in the two
 * diagonals is the same value. For example,
 * 
 *　　16   3    2    13
 *　　5    10   11   8
 *　　9    6    7    12
 *　　4    15   14   1
 * 
 * Write a program that reads in n2 values from the keyboard and tests whether they
 * orm a magic square when arranged as a square matrix. You need to test three
 * features:
 * • Did the user enter n2 numbers for some n?
 * • Do each of the numbers 1, 2, . . . , n2 occur exactly once in the user input?
 * • When the numbers are put into a square, are the sums of the rows, columns,
 * and diagonals equal to each other?
 * If the size of the input is a square, test whether all numbers between 1 and n2 are
 * present. Then compute the row, column, and diagonal su