leetcode 566Reshape the Matrix -java

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 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:
The height and width of the given matrix is in range [1, 100].
The given r and c are all positive.

题意:重塑数组,将给定的二维数组重塑成给定的r行c列的数组,只是形状变化,数值不变

思路:将原始二维数组保存在一个一位数组中,创建空的给定r\c的二维数组,再将一位数组的数值按顺序读取到二维数组中

bug:
1、在网页上编程各种漏写;]
2、计算二维数组的长度:不是用nums.length,这个是行长,要再乘列长
3、用foreach遍历二维数组方法

for (int[] is : arr) {
            for (int i : is) {
                System.out.print(i + ",");
            }
        }
class Solution {
    public int[][] matrixReshape(int[][] nums, int r, int c) {
        int i = nums.length;
        int j = nums[0].length;
        int sum = i*j;//二维数组的长度是行长*列长
        int sum_new = r*c;
        int a = 0;
        int[] A = new int[sum];
        int[][] B = new int[r][c];//创建一维和二维数组的方式
        if(sum != sum_new) {
            return nums;
        }else {

            for(int x=0;x<i;x++){
                for(int y=0;y<j;y++){
                    A[a] = nums[x][y];
                    a += 1;
                }
            }
            a = 0;
            for(int x =0;x<r;x++){
                for(int y=0;y<c;y++){
                    B[x][y] = A[a];
                    a += 1;
                }
            }
            return B;//注意return
        }
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值