566. Reshape the Matrix

原题链接

/**
 * Created by Joe on 2017/12/13.
 * https://leetcode.com/problems/reshape-the-matrix/description/
 */
public class P566 {
    public int[][] matrixReshape(int[][] nums, int r, int c) {
        int n = nums.length, m =nums[0].length;

        if (n * m != r * c) {
            return nums;
        }

        int[] oneDimenson = new int[n * m];

        int count = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                oneDimenson[count] = nums[i][j];
                count++;
            }
        }

        int[][] reshape = new int[r][c];
        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                reshape[i][j] = oneDimenson[i * c + j];
            }
        }

        return reshape;
    }
}

上述是自己实现的方法，但是相比讨论区的实现又略显笨重，这里特贴上来讨论区的实现方法

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

他的方法主要是略去中间转化为一维的过程，通过数学算式直接寻找两个等式之间的关系。