给定2 个m×n方格阵列组成的图形A和B，每个方格的颜色为黑色或白色。行列变换问题的每一步变换可以交换任意2行或2列方格的颜色，或者将某行或某列颠倒。上述每次变换算作一步。试设计一个算法，计算最少需要多少步，才能将图形A变换为图形B-The graphics given 2 mn grid array A and B, the color of each square is black or white. Ranks transform every step of the transformation can swap any two rows or two squares of color, or a row or a column upside down. The above transform counted as one step at a time. Try to design an algorithm computing requires a minimum number of steps, transform graphics A graphic B