A magic square is a 3x3 array of numbers, such that the sum of each row, column, and diagonal are all the same. For example:
8 1 6
3 5 7
4 9 2
In this example, all rows, columns, and diagonals sum to 15.
You will be given a int[] representing the nine numbers of a magic square, listed lefttoright, toptobottom. However, one of these numbers will be replaced by a 1. Write a method to determine which number was removed. For example, if the 7 was removed from the magic square above, you would be given { 8, 1, 6, 3, 5, 1, 4, 9, 2 }, and your program should return 7.
The completed magic square will consist of exactly 9 distinct positive integers.
