简单有趣#145:桌面游戏【难度:1级】: 答案1: namespace myjinxin { public class Kata { public int[] TableGame(int[][] t) { if (t[0][0] + t[0][2] != t[0][1] || t[0][0] + t[2][0] != t[1][0] || t[0][2] + t[2][2] != t[1][2] || t[2][0] + t[2][2] != t[2][1] || t[0][0] + t[0][2] + t[2][0] + t[2][2] != t[1][1]) return new int[] { -1 }; return new int[] { t[0][0], t[0][2], t[2][0], t[2][2] }; } } } 答案2: namespace myjinxin { public class Kata { public int[] TableGame(int[][] table) { // Check if the grid is possible to solve if (table[0][0] + table[0][2] == table[0][1] && table[0][0] + table[2][0] == table[1][0] && table[0][2] + table[2][2] == table[1][2] && table[2][0] + table[2][2] == table[