leetcode 566. Reshape the Matrix

In MATLAB, there is a very useful function called 'reshape', which can reshape a matrix into a new one with different size but keep its original data.

You're given a matrix represented by a two-dimensional array, and two positive integers r and c representing the row number and columnnumber 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].
2. The given r and c are all positive.

这个算简单的。

public class Reshape_the_Matrix_566 {

	public int[][] matrixReshape(int[][] nums, int r, int c) {
		int[][] newNums=new int[r][c];
		int maxNum=r*c;
		int count=0;
		int pointerx=0;
		int pointery=0;
		for (int i = 0; i < nums.length; i++) {
			for (int j = 0; j < nums[0].length; j++) {
				if (pointerx == r) {
					return nums;
				}
				newNums[pointerx][pointery] = nums[i][j];
				count++;
				if (pointery + 1 == c) {
					pointerx++;
					pointery=0;
				} else {
					pointery++;
				}
			}
		}
		if(count<maxNum){
			return nums;
		}
		return newNums;
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Reshape_the_Matrix_566 r=new Reshape_the_Matrix_566();
		int[][] a=new int[][]{{1,2,3,4}};
		int[][] result=r.matrixReshape(a, 2, 2);
		for(int i=0;i<result.length;i++){
			for(int j=0;j<result[0].length;j++){
				System.out.print(result[i][j]+" ");
			}
			System.out.println();
		}
	}
}

需要注意的是System.out.print(result[i][j]+" ");而不是System.out.print(result[i][j]+' ');因为用单引号的话，就变成了数字+空格的ASCII码了。如result[i][j]=0的话，那结果就是32（因为空格的ASCII码是32）

看到大神的思路相同，但是更简洁的做法。直接判断m*n!=r*c就return旧数组了。

public class Solution {
    public int[][] matrixReshape(int[][] nums, int r, int c) {
        int m = nums.length, n = nums[0].length;
        if (m * n != r * c) return nums;
        
        int[][] result = new int[r][c];
        int row = 0, col = 0;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                result[row][col] = nums[i][j];
                col++;
                if (col == c) {
                    col = 0;
                    row++;
                }
            }
        }
        
        return result;
    }
}

还有这个，用/和%来获得行数和列数，真是太妙了。

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

比如[0/2][0%2]=[0][0]，[1/2][1%2]=[0][1]，[2/2][2%2]=[1][0]，[3/2][3%2]=[1][1]，很妙啊！