Click here to download the IntelliJ project for this exercise. Alternatively, you can find all the exercices on this git repository
This exercise is already available in your IntelliJ as a project.
What you need to do is described in the comments at the top of the file in src/main/java/
.
package basics; public class MagicSquare { /** * A magic square is an (n x n) matrix such that: * * - all the positive numbers 1,2, ..., n*n are present (thus each number appears exactly once) * - the sums of the numbers in each row, each column and both main diagonals are the same * * For instance a 3 x 3 magic square is the following * * 2 7 6 * 9 5 1 * 4 3 8 * * You have to implement the method that verifies if a matrix is a valid magic square */ /** * * @param matrix a square matrix of size n x n * @return true if matrix is a n x n magic square, false otherwise */ public static boolean isMagicSquare(int [][] matrix) { // TODO Implement the body of this method, feel free to add other methods but do not change the signature of isMagiSquare return false; } }
- Instruction provided at the top of the source file on IntelliJ.
- Debug using small and easy unit tests provided in junit tests, it can also help to clarify the instructions.