feat: add js solution to lc problem: No.1940 (#1027)

Author: Qiu-IT

solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md

@@ -161,6 +161,27 @@ func longestCommomSubsequence(arrays [][]int) []int {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[][]} arrays
+ * @return {number[]}
+ */
+var longestCommonSubsequence = function (arrays) {
+    const m = new Map();
+    const rs = [];
+    const len = arrays.length;
+    for (let i = 0; i < len; i++) {
+        for (let j = 0; j < arrays[i].length; j++) {
+            m.set(arrays[i][j], (m.get(arrays[i][j]) || 0) + 1);
+            if (m.get(arrays[i][j]) === len) rs.push(arrays[i][j]);
+        }
+    }
+    return rs;
+};
+```
+
 ### **...**
 
 ```

solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md

@@ -151,6 +151,27 @@ func longestCommomSubsequence(arrays [][]int) []int {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[][]} arrays
+ * @return {number[]}
+ */
+var longestCommonSubsequence = function (arrays) {
+    const m = new Map();
+    const rs = [];
+    const len = arrays.length;
+    for (let i = 0; i < len; i++) {
+        for (let j = 0; j < arrays[i].length; j++) {
+            m.set(arrays[i][j], (m.get(arrays[i][j]) || 0) + 1);
+            if (m.get(arrays[i][j]) === len) rs.push(arrays[i][j]);
+        }
+    }
+    return rs;
+};
+```
+
 ### **...**
 
 ```

solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/Solution.js

@@ -0,0 +1,16 @@
+/**
+ * @param {number[][]} arrays
+ * @return {number[]}
+ */
+var longestCommonSubsequence = function (arrays) {
+    const m = new Map();
+    const rs = [];
+    const len = arrays.length;
+    for (let i = 0; i < len; i++) {
+        for (let j = 0; j < arrays[i].length; j++) {
+            m.set(arrays[i][j], (m.get(arrays[i][j]) || 0) + 1);
+            if (m.get(arrays[i][j]) === len) rs.push(arrays[i][j]);
+        }
+    }
+    return rs;
+};