feat: add solutions to lc problem: No.2022 (doocs#649)

* feat: add solution to lc problem: No.2022

* feat: add solution to lc problem: No.2022

Author: YangFong

solution/2000-2099/2022.Convert 1D Array Into 2D Array/README.md

@@ -65,6 +65,10 @@ original 中只有 1 个元素。
 
 <!-- 这里可写通用的实现逻辑 -->
 
+在该题当中，想要成功转换为二维数组，**元素不能少也不能多**，所以需要先做一次长度判断，不对等的情况下直接退出。
+
+在数量正确时，则按照给出的规格，将 `original` 分割成小数组，放入返回数组当中。
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -135,6 +139,48 @@ func construct2DArray(original []int, m int, n int) [][]int {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} original
+ * @param {number} m
+ * @param {number} n
+ * @return {number[][]}
+ */
+var construct2DArray = function(original, m, n) {
+    const result = [];
+
+    if (original.length != m * n) {
+        return result;
+    }
+    
+    for (let i = 0; i < m; i++) {
+        result.push(original.slice(i * n, i * n + n));
+    }
+    
+    return result;
+};
+```
+
+### **TypeScript**
+
+```ts
+function construct2DArray(original: number[], m: number, n: number): number[][] {
+    const result = [];
+
+    if (original.length != m * n) {
+        return result;
+    }
+    
+    for (let i = 0; i < m; i++) {
+        result.push(original.slice(i * n, i * n + n));
+    }
+    
+    return result;
+};
+```
+
 ### **...**
 
 ```

solution/2000-2099/2022.Convert 1D Array Into 2D Array/README_EN.md

@@ -129,6 +129,48 @@ func construct2DArray(original []int, m int, n int) [][]int {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} original
+ * @param {number} m
+ * @param {number} n
+ * @return {number[][]}
+ */
+var construct2DArray = function(original, m, n) {
+    const result = [];
+
+    if (original.length != m * n) {
+        return result;
+    }
+    
+    for (let i = 0; i < m; i++) {
+        result.push(original.slice(i * n, i * n + n));
+    }
+    
+    return result;
+};
+```
+
+### **TypeScript**
+
+```ts
+function construct2DArray(original: number[], m: number, n: number): number[][] {
+    const result = [];
+
+    if (original.length != m * n) {
+        return result;
+    }
+    
+    for (let i = 0; i < m; i++) {
+        result.push(original.slice(i * n, i * n + n));
+    }
+    
+    return result;
+};
+```
+
 ### **...**
 
 ```

solution/2000-2099/2022.Convert 1D Array Into 2D Array/Solution.js

@@ -0,0 +1,19 @@
+/**
+ * @param {number[]} original
+ * @param {number} m
+ * @param {number} n
+ * @return {number[][]}
+ */
+var construct2DArray = function(original, m, n) {
+    const result = [];
+
+    if (original.length != m * n) {
+        return result;
+    }
+
+    for (let i = 0; i < m; i++) {
+        result.push(original.slice(i * n, i * n + n));
+    }
+
+    return result;
+};

solution/2000-2099/2022.Convert 1D Array Into 2D Array/Solution.ts

@@ -0,0 +1,13 @@
+function construct2DArray(original: number[], m: number, n: number): number[][] {
+    const result = [];
+
+    if (original.length != m * n) {
+        return result;
+    }
+
+    for (let i = 0; i < m; i++) {
+        result.push(original.slice(i * n, i * n + n));
+    }
+
+    return result;
+};