Introduction - If you have any usage issues, please Google them yourself
//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* /