原题链接在这里: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:

 public class Solution {
public int[][] matrixReshape(int[][] nums, int r, int c) {
if(nums == null || nums.length == 0 || nums[0].length == 0){
return nums;
} int m = nums.length;
int n = nums[0].length;
if(m*n != r*c){
return nums;
} int [][] res = new int[r][c];
int count = 0;
for(int i = 0; i<m; i++){
for(int j = 0; j<n; j++){
res[count/c][count%c] = nums[i][j];
count++;
}
} return res;
}
}

最新文章

  1. javascript方法链式调用和构造函数链式调用对比
  2. CSS值得关注的那些事?
  3. iOS 秒数转换成时间,时,分,秒
  4. Effective Java 13 Minimize the accessibility of classes and members
  5. initWithNibName&amp;initWithCoder &amp;awakeFromNib&amp;UIView常见属性方法
  6. Excel操作类
  7. 【转载】拒绝平庸——浅谈WEB登录页面设计
  8. win8以上版本离线安装.NET
  9. html5 拖放到购物车
  10. hdu 4497 GCD and LCM
  11. Linux 下 将使用Python-Django开发的web应用布置到服务器上(亲测有效)
  12. DDD(领域驱动设计)应对具体业务场景,如何聚焦 Domain Model(领域模型)?
  13. #图# #dijkstra# ----- OpenJudge 726:ROADS
  14. MVC5+EF6 完整教程17--升级到EFCore2.0
  15. js面向对象之继承那点事儿根本就不是事
  16. ASP.NET CORE系列【一】搭建ASP.NET CORE项目
  17. XVIII Open Cup named after E.V. Pankratiev. GP of Romania
  18. 使用Shader制作loading旋转动画
  19. Nginx 负载均衡一致性算法
  20. Xamarin.Android 使用ListView绑定数据

热门文章

  1. linux练习命令
  2. Linux服务器iops性能测试-fio
  3. Ajax+Spring MVC实现跨域请求(JSONP)
  4. ajax数据请求的理解
  5. HP小型机维护
  6. 【Tech】CAS RESTful API使用笔记
  7. PHP的垃圾回收机制以及大概实现
  8. Kubernetes Headless Service
  9. java 反射机制复习笔记。
  10. 使用 grep 查找所有包含指定文本的文件