ReshapeTheMatrix

You're given a matrix represented by a two-dimensional array, and two positive integers r and c representing the row number and column number of the wanted reshaped matrix, respectively.

The reshaped matrix need to be filled with all the elements of the original matrix in the same row-traversing order as they were.

If the 'reshape' operation with given parameters is possible and legal, output the new reshaped matrix; Otherwise, output the original matrix.

Example 1:

Input: 
nums = 
[[1,2],
 [3,4]]
r = 1, c = 4
Output: 
[[1,2,3,4]]
Explanation:
The row-traversing of nums is [1,2,3,4]. The new reshaped matrix is a 1 * 4 matrix, fill it row by row by using the previous list.

Example 2:

Input: 
nums = 
[[1,2],
 [3,4]]
r = 2, c = 4
Output: 
[[1,2],
 [3,4]]
Explanation:
There is no way to reshape a 2 * 2 matrix to a 2 * 4 matrix. So output the original matrix.

Note:

1. The height and width of the given matrix is in range [1, 100].

1. The given r and c are all positive.

解决：

1.对矩阵根据新的行和列数重新排列

2.如果旧矩阵的行列积和新行列积不相等则没办法排列，返回原矩阵

比较一般的想法就是使用一个队列的数据结构，遍历数组保存每个元素然后依次把元素存进新的数组中，这个不必多说。

稍微想一下其实不管这个矩阵不管怎样变形变化，它的元素排列总是从左到右从上下顺列排列的。新旧矩阵按顺序的第i个

元素一定相同，只不过行列发生了变化。现在我们就是想要找到第i个元素在新矩阵的行列数（r,c）与在旧矩阵的行列数（m,n）的关系。

第i个元素，在旧矩阵中存在第i/n行，第i%n列，在新矩阵中存在第i/c行，第i%c列。一共r*c个元素，把每个元素都从旧矩阵搬家到新

矩阵即可。

    public int[][] matrixReshape(int[][] nums, int r, int c) {
        if(nums == null || nums.length == 0)
        	return null;
        if(r * c != nums.length * nums[0].length)
        	return nums;
        int[][] rtn = new int[r][c];
        int m = nums.length;
        int n = nums[0].length;
        for(int i=0; i<r*c; i++) {
        	rtn[i/c][i%c] = nums[i/n][i%n];
        }
        return rtn;
    }