Leetcode 566(Java)
来源:互联网 发布:等到烟火清 知乎 编辑:程序博客网 时间:2024/06/16 14:39
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.
首先判断要输出结果的矩阵大小与原矩阵大小是否相符,若不相符返回原矩阵即可。判定方法也很简单,只要元素个数相等就可以视为符合。接下来利用队列,将原矩阵的元素一个个ADD进去,再一个个POLL到新矩阵中,输出即可。
AC码:
public class Solution { public int[][] matrixReshape(int[][] nums, int r, int c) { int rr = nums.length,cc=nums[0].length; int[][] result = new int[r][c]; if(rr*cc != r*c)return nums; Queue<Integer> queue = new LinkedList<Integer>(); for(int i=0;i<rr;i++){ for(int j=0;j<cc;j++){ queue.add(nums[i][j]); } } for(int x=0;x<r;x++){ for(int y=0;y<c;y++){ result[x][y] = queue.poll(); } } return result; }}
- Leetcode 566(Java)
- Leetcode(java)
- leetcode java
- [LeetCode]Next Permutation java leetcode
- LeetCode: Two Sum (Java)
- [Leetcode] Two Sum (Java)
- [Leetcode] ZigZag Conversion (Java)
- [Leetcode] Reverse Integer (Java)
- [Leetcode] Palindrome Number (Java)
- [Leetcode] Valid Parentheses (Java)
- [Leetcode] Generate Parentheses (Java)
- [Leetcode] Remove Element (Java)
- [Leetcode] Implement strStr() (Java)
- [Leetcode] Next Permutation (Java)
- [Leetcode] Valid Sudoku (Java)
- [Leetcode] Sudoku Solver (Java)
- [Leetcode] Combination Sum (Java)
- [Leetcode] Multiply Strings (Java)
- Json解析包 阿里巴巴 FastJson 的使用
- selenium安装和chromedriver配置
- mongo3.4权限控制
- WAMPServer自定义网站根目录
- logging库的使用
- Leetcode 566(Java)
- Android中TextView开头空两格的问题
- Wiggle Subsequence
- 几种简单的排序总结
- HDU
- Hibernate的三种状态转换
- 【Java基础】Java字符串常用操作(String类)
- WAMPServer随写笔记,PHP语言结构语句
- django中的forms构建