From 76cd5b8e658e48ee5447761ec645ca1ab2315c2a Mon Sep 17 00:00:00 2001 From: Qiu-IT Date: Fri, 9 Jun 2023 10:38:25 +0200 Subject: [PATCH 1/3] feat: add js solution to lc problem:No.1940 --- .../README.md | 23 +++++++++++++++++++ .../README_EN.md | 23 +++++++++++++++++++ .../Solution.js | 18 +++++++++++++++ 3 files changed, 64 insertions(+) create mode 100644 solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/Solution.js diff --git a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md index 786857225dfcc..cac159d1223e1 100644 --- a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md +++ b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md @@ -161,6 +161,29 @@ func longestCommomSubsequence(arrays [][]int) []int { } ``` +### **PHP** + +```php +/** + * @param {number[][]} arrays + * @return {number[]} + */ +var longestCommonSubsequence = function (arrays) { + let m = new Map(); + let 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); + } + } + for (let k of m.keys()) { + if (m.get(k) === len) rs.push(k); + } + return rs; +}; +``` + ### **...** ``` diff --git a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md index e4672a43ec538..2bdd8f6635bf3 100644 --- a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md +++ b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md @@ -151,6 +151,29 @@ func longestCommomSubsequence(arrays [][]int) []int { } ``` +### **PHP** + +```php +/** + * @param {number[][]} arrays + * @return {number[]} + */ +var longestCommonSubsequence = function (arrays) { + let m = new Map(); + let 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); + } + } + for (let k of m.keys()) { + if (m.get(k) === len) rs.push(k); + } + return rs; +}; +``` + ### **...** ``` diff --git a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/Solution.js b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/Solution.js new file mode 100644 index 0000000000000..03673a3b751fc --- /dev/null +++ b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/Solution.js @@ -0,0 +1,18 @@ +/** + * @param {number[][]} arrays + * @return {number[]} + */ +var longestCommonSubsequence = function (arrays) { + let m = new Map(); + let 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); + } + } + for (let k of m.keys()) { + if (m.get(k) === len) rs.push(k); + } + return rs; +}; From ab0852483d1234c477198ac319430d12bc9953a1 Mon Sep 17 00:00:00 2001 From: Qiu-IT Date: Fri, 9 Jun 2023 10:41:44 +0200 Subject: [PATCH 2/3] update js solution --- .../README.md | 4 ++-- .../README_EN.md | 4 ++-- 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md index cac159d1223e1..49251f6326047 100644 --- a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md +++ b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md @@ -161,9 +161,9 @@ func longestCommomSubsequence(arrays [][]int) []int { } ``` -### **PHP** +### **JavaScript** -```php +```js /** * @param {number[][]} arrays * @return {number[]} diff --git a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md index 2bdd8f6635bf3..72e868ef626d9 100644 --- a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md +++ b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md @@ -151,9 +151,9 @@ func longestCommomSubsequence(arrays [][]int) []int { } ``` -### **PHP** +### **JavaScript** -```php +```js /** * @param {number[][]} arrays * @return {number[]} From d83adbd4676175a4d698ddda18cc56a198cfe07f Mon Sep 17 00:00:00 2001 From: Qiu-IT Date: Fri, 9 Jun 2023 11:04:22 +0200 Subject: [PATCH 3/3] update2 js solution --- .../README.md | 8 +++----- .../README_EN.md | 8 +++----- .../Solution.js | 8 +++----- 3 files changed, 9 insertions(+), 15 deletions(-) diff --git a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md index 49251f6326047..db9d10ee749df 100644 --- a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md +++ b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md @@ -169,17 +169,15 @@ func longestCommomSubsequence(arrays [][]int) []int { * @return {number[]} */ var longestCommonSubsequence = function (arrays) { - let m = new Map(); - let rs = []; + 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]); } } - for (let k of m.keys()) { - if (m.get(k) === len) rs.push(k); - } return rs; }; ``` diff --git a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md index 72e868ef626d9..f86d3b3504a13 100644 --- a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md +++ b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md @@ -159,17 +159,15 @@ func longestCommomSubsequence(arrays [][]int) []int { * @return {number[]} */ var longestCommonSubsequence = function (arrays) { - let m = new Map(); - let rs = []; + 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]); } } - for (let k of m.keys()) { - if (m.get(k) === len) rs.push(k); - } return rs; }; ``` diff --git a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/Solution.js b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/Solution.js index 03673a3b751fc..0db3b375d48d4 100644 --- a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/Solution.js +++ b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/Solution.js @@ -3,16 +3,14 @@ * @return {number[]} */ var longestCommonSubsequence = function (arrays) { - let m = new Map(); - let rs = []; + 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]); } } - for (let k of m.keys()) { - if (m.get(k) === len) rs.push(k); - } return rs; };