Add problem 566

Author: avhn

algorithms/566/README.md

@@ -0,0 +1,43 @@
+## 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 **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:**
+<pre>
+<b>Input:</b>
+nums = 
+[[1,2],
+ [3,4]]
+r = 1, c = 4
+<b>Output:</b>
+[[1,2,3,4]]
+<b>Explanation:</b>
+The <b>row-traversing</b> 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.
+</pre>
+
+**Example 2:**
+<pre>
+<b>Input:</b>
+nums = 
+[[1,2],
+ [3,4]]
+r = 2, c = 4
+<b>Output:</b>
+[[1,2],
+ [3,4]]
+<b>Explanation:</b>
+There is no way to reshape a 2 * 2 matrix to a 2 * 4 matrix. So output the original
+matrix.
+</pre>
+
+**Note:**
+
+1. The height and width of the given matrix is in range [1, 100].
+2. The given r and c are all positive.

algorithms/566/solution.go

@@ -0,0 +1,24 @@
+package main
+
+// Time and space complexity, O(r*c)
+func matrixReshape(nums [][]int, r int, c int) [][]int {
+if len(nums)*len(nums[0]) != r*c {
+return nums
+}
+
+matrix := make([][]int, r)
+matrix[0] = make([]int, c)
+rr, cc := len(nums), len(nums[0])
+for i, j, ii := 0, 0, 0; ii < rr; ii++ {
+for jj := 0; jj < cc; jj++ {
+if j == c {
+i++
+matrix[i] = make([]int, c)
+j = 0
+}
+matrix[i][j] = nums[ii][jj]
+j++
+}
+}
+return matrix
+}