zoukankan      html  css  js  c++  java
  • LeetCode Reshape the Matrix

    原题链接在这里:https://leetcode.com/problems/reshape-the-matrix/#/description

    题目:

    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:

    1. The height and width of the given matrix is in range [1, 100].
    2. The given r and c are all positive.

    题解:

    利用count/c 和 count%c找到nums元素在结果matrix中的位置.

    Time Complexity: O(m*n). m = nums.length, n = nums[0].length.

    Space: O(m*n). res space.

    AC Java:

     1 public class Solution {
     2     public int[][] matrixReshape(int[][] nums, int r, int c) {
     3         if(nums == null || nums.length == 0 || nums[0].length == 0){
     4             return nums;
     5         }
     6         
     7         int m = nums.length;
     8         int n = nums[0].length;
     9         if(m*n != r*c){
    10             return nums;
    11         }
    12         
    13         int [][] res = new int[r][c];
    14         int count = 0;
    15         for(int i = 0; i<m; i++){
    16             for(int j = 0; j<n; j++){
    17                 res[count/c][count%c] = nums[i][j];
    18                 count++;
    19             }
    20         }
    21         
    22         return res;
    23     }
    24 }
  • 相关阅读:
    Win7下VS2010、IIS7配置常见问题收集
    ASP.NET 4.0尚未在 Web 服务器上注册 解决方法
    jQuery
    玩转OpenStack
    ubuntu14.04开启root用户 设置root密码 配置国内镜像源 设置分辨率
    JavaScripts基础
    css
    微信小程序Nginx环境配置
    html语言
    Python并发编程-redis-3.0.5 源码安装
  • 原文地址:https://www.cnblogs.com/Dylan-Java-NYC/p/7069512.html
Copyright © 2011-2022 走看看