leetcode:566. 重塑矩阵（java实现)

class Solution {
    public int[][] matrixReshape(int[][] nums, int r, int c) {
		if (nums.length * nums[0].length != r * c) {
			return nums;
		}
		int tempnums[] = new int[r * c];
		int k = 0;
		for (int[] num : nums) {
			for (int number : num) {
				tempnums[k++] = number;
			}
		}
		int n=0;
		int newnums[][]=new int[r][c];
		for (int i = 0; i < r; i++) {
			for (int j = 0; j < c; j++) {
				newnums[i][j]=tempnums[n++];
			}
		}
		return newnums;
	}
}

总结：这题没啥意思