//金币阵列问题

/*算法思想：将原始数列作为参考数列（m*n)，将目标数列的第一列与本身的-n列分别进行对调

在每次对调后进行一下处理：比较对调后的第一列与原始数列的第一列，从而知道对应的行是否要

进行变换。行变换确定后，然后确定列变换，通过列遍历性的交换，将目标数列转换到原始数列*/

-//Gold array problem

/* Algorithm thinking: the original series as the reference sequence (m* n), the first column of the target sequence itself-n columns swapped

After each swap: relatively reversed after the first column the first column of the original series, so you know the row corresponding to whether or not to

Be transformed. Line transformation is determined, then determine the column transform exchange column ergodicity, the number of targets are converted to the original number of columns* /