zoukankan      html  css  js  c++  java
  • 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 rownumber 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.

    方法一:借助中间数组
    class Solution {
        public int[][] matrixReshape(int[][] nums, int r, int c) {
            int row=nums.length;
            int col=nums[0].length;
            
            if(row*col!=r*c){
                return nums;
            }else{
                int [][] res=new int[r][c];
                int [] reseve=new int[row*col];
                int z=0;
                for(int i=0;i<row;i++){
                    for(int j=0;j<col;j++){
                        reseve[z++]=nums[i][j];
                    }
                }
                z=0;
                for(int i=0;i<r;i++){
                    for(int j=0;j<c;j++){
                        res[i][j]=reseve[z++];
                    }
                }
                return res;
            }
        }
    }

    方法二:直接转换

    class Solution {
        public int[][] matrixReshape(int[][] nums, int r, int c) {
            int row=nums.length;
            int col=nums[0].length;
            
            if(row*col!=r*c){
                return nums;
            }
            int [][] res=new int[r][c];
            int index=0;
            for(int i=0;i<r;i++){
                for(int j=0;j<c;j++){
                    res[i][j]=nums[index/col][index%col];
                    index++;
                }
            }
            return res;
        }
    }
    苟有恒,何必三更眠五更起;最无益,莫过一日暴十日寒。
  • 相关阅读:
    Kafka相关知识点
    好的前端界面
    linux下配置go环境
    插入排序(数据是局部有序的)
    选择排序
    spring jpa 条件查询统计
    java代码优化
    JAVA创建临时文件IO
    spring防止表单重复提交
    Java文件下载时所输出文件名乱码问题
  • 原文地址:https://www.cnblogs.com/shaer/p/10864722.html
Copyright © 2011-2022 走看看