feat: add js solution to lc problem: No.2225 (#2218)

Author: azzect

solution/2200-2299/2225.Find Players With Zero or One Losses/README.md

@@ -167,6 +167,34 @@ func findWinners(matches [][]int) [][]int {
 }
 ```
 
+### **JavaScript**
+
+```js
+var findWinners = function (matches) {
+    const onlyWins = new Set(),
+        oneLose = new Set(),
+        moreLosses = new Set();
+
+    for (const [winner, loser] of matches) {
+        if (!moreLosses.has(loser)) {
+            if (oneLose.has(loser)) {
+                oneLose.delete(loser);
+                moreLosses.add(loser);
+            } else {
+                onlyWins.delete(loser);
+                oneLose.add(loser);
+            }
+        }
+
+        if (!moreLosses.has(winner) && !oneLose.has(winner)) {
+            onlyWins.add(winner);
+        }
+    }
+
+    return [[...onlyWins].sort((a, b) => a - b), [...oneLose].sort((a, b) => a - b)];
+};
+```
+
 ### **TypeScript**
 
 ```ts

solution/2200-2299/2225.Find Players With Zero or One Losses/README_EN.md

@@ -155,6 +155,34 @@ func findWinners(matches [][]int) [][]int {
 }
 ```
 
+### **JavaScript**
+
+```js
+var findWinners = function (matches) {
+    const onlyWins = new Set(),
+        oneLose = new Set(),
+        moreLosses = new Set();
+
+    for (const [winner, loser] of matches) {
+        if (!moreLosses.has(loser)) {
+            if (oneLose.has(loser)) {
+                oneLose.delete(loser);
+                moreLosses.add(loser);
+            } else {
+                onlyWins.delete(loser);
+                oneLose.add(loser);
+            }
+        }
+
+        if (!moreLosses.has(winner) && !oneLose.has(winner)) {
+            onlyWins.add(winner);
+        }
+    }
+
+    return [[...onlyWins].sort((a, b) => a - b), [...oneLose].sort((a, b) => a - b)];
+};
+```
+
 ### **TypeScript**
 
 ```ts

solution/2200-2299/2225.Find Players With Zero or One Losses/Solution.js

@@ -0,0 +1,23 @@
+var findWinners = function (matches) {
+    const onlyWins = new Set(),
+        oneLose = new Set(),
+        moreLosses = new Set();
+
+    for (const [winner, loser] of matches) {
+        if (!moreLosses.has(loser)) {
+            if (oneLose.has(loser)) {
+                oneLose.delete(loser);
+                moreLosses.add(loser);
+            } else {
+                onlyWins.delete(loser);
+                oneLose.add(loser);
+            }
+        }
+
+        if (!moreLosses.has(winner) && !oneLose.has(winner)) {
+            onlyWins.add(winner);
+        }
+    }
+
+    return [[...onlyWins].sort((a, b) => a - b), [...oneLose].sort((a, b) => a - b)];
+};