【LeetCode】566.Reshape the Matrix解题报告
来源:互联网 发布:淘宝上的狗狗疫苗 编辑:程序博客网 时间:2024/06/10 17:38
【LeetCode】566.Reshape the Matrix解题报告
tags: Array
题目地址:https://leetcode.com/problems/reshape-the-matrix/#/description
题目描述:
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.
Example1:
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.
Example2:
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.
Solutions:
public class Solution { public int[][] matrixReshape(int[][] nums, int r, int c) { int original_r = nums.length; int original_c = nums[0].length; if (original_r * original_c == r * c) { int[][] result = new int[r][c]; for (int i = 0; i < r * c; i++) { result[i / c][i % c] = nums[i / original_c][i % original_c]; } return result; } else { return nums; } }}
本题利用nums.length,它的值就是矩阵的行数,nums[0].length就是列数,后面一个巧妙运用除和求余得到行列数,得解。
Date:2017年5月25日
- 【LeetCode】566.Reshape the Matrix解题报告
- [Leetcode] 566. Reshape the Matrix 解题报告
- leetcode 566. Reshape the Matrix
- LeetCode 566. Reshape the Matrix
- [LeetCode]566. Reshape the Matrix
- [leetcode]566. Reshape the Matrix
- LeetCode:566. Reshape the Matrix
- leetcode 566. Reshape the Matrix
- LeetCode | 566. Reshape the Matrix
- leetcode-566. Reshape the Matrix
- LeetCode 566.Reshape the Matrix
- LeetCode: 566. Reshape the Matrix
- LeetCode-566. Reshape the Matrix
- LeetCode * 566.Reshape the Matrix
- LeetCode: 566. Reshape the Matrix
- leetcode.566.Reshape the Matrix
- LeetCode 566. Reshape the Matrix
- [LeetCode] 566. Reshape the Matrix
- H264(NAL简介与I帧判断)
- 常用js跳转页面方法
- ERROR 1205 (HY000): Lock wait timeout exceeded; try restarting transaction
- 给RecyclerView最纯粹的下拉刷新和上拉加载更多
- mongodb 数据库操作--备份 还原 导出 导入
- 【LeetCode】566.Reshape the Matrix解题报告
- Hadoop实践(一)---Hadoop核心组件之YARN
- Android 本地时间/时区自动更新 -- NITZ
- TF/02_TensorFlow_Way/05 Implementing Back Propagation
- 面试题17合并两个排序链表
- CSS
- h264 NAL头解析
- NGINX的原理、安装、配置以及使用tomcat在linux上搭载集群环境
- iOS开发学习笔记之UILabel的使用