feat: add js/ts solution to lc problem: No.2225

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

@@ -167,9 +167,57 @@ func findWinners(matches [][]int) [][]int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findWinners(matches: number[][]): number[][] {
+    const cnt: Map<number, number> = new Map();
+    for (const [a, b] of matches) {
+        cnt.set(a, cnt.has(a) ? cnt.get(a) : 0);
+        cnt.set(b, (cnt.get(b) || 0) + 1);
+    }
+    const ans: number[][] = [[], []];
+    for (let [u, v] of cnt.entries()) {
+        if (v < 2) {
+            ans[v].push(u);
+        }
+    }
+    ans[0].sort((a, b) => a - b);
+    ans[1].sort((a, b) => a - b);
+    return ans;
+}
+```
+
 ### **JavaScript**
 
 ```js
+/**
+ * @param {number[][]} matches
+ * @return {number[][]}
+ */
+var findWinners = function (matches) {
+    const cnt = new Map();
+    for (const [a, b] of matches) {
+        cnt.set(a, cnt.has(a) ? cnt.get(a) : 0);
+        cnt.set(b, (cnt.get(b) || 0) + 1);
+    }
+    const ans = [[], []];
+    for (let [u, v] of cnt.entries()) {
+        if (v < 2) {
+            ans[v].push(u);
+        }
+    }
+    ans[0].sort((a, b) => a - b);
+    ans[1].sort((a, b) => a - b);
+    return ans;
+};
+```
+
+```js
+/**
+ * @param {number[][]} matches
+ * @return {number[][]}
+ */
 var findWinners = function (matches) {
     const onlyWins = new Set(),
         oneLose = new Set(),

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

@@ -155,9 +155,57 @@ func findWinners(matches [][]int) [][]int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findWinners(matches: number[][]): number[][] {
+    const cnt: Map<number, number> = new Map();
+    for (const [a, b] of matches) {
+        cnt.set(a, cnt.has(a) ? cnt.get(a) : 0);
+        cnt.set(b, (cnt.get(b) || 0) + 1);
+    }
+    const ans: number[][] = [[], []];
+    for (let [u, v] of cnt.entries()) {
+        if (v < 2) {
+            ans[v].push(u);
+        }
+    }
+    ans[0].sort((a, b) => a - b);
+    ans[1].sort((a, b) => a - b);
+    return ans;
+}
+```
+
 ### **JavaScript**
 
 ```js
+/**
+ * @param {number[][]} matches
+ * @return {number[][]}
+ */
+var findWinners = function (matches) {
+    const cnt = new Map();
+    for (const [a, b] of matches) {
+        cnt.set(a, cnt.has(a) ? cnt.get(a) : 0);
+        cnt.set(b, (cnt.get(b) || 0) + 1);
+    }
+    const ans = [[], []];
+    for (let [u, v] of cnt.entries()) {
+        if (v < 2) {
+            ans[v].push(u);
+        }
+    }
+    ans[0].sort((a, b) => a - b);
+    ans[1].sort((a, b) => a - b);
+    return ans;
+};
+```
+
+```js
+/**
+ * @param {number[][]} matches
+ * @return {number[][]}
+ */
 var findWinners = function (matches) {
     const onlyWins = new Set(),
         oneLose = new Set(),

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

@@ -1,23 +1,20 @@
+/**
+ * @param {number[][]} matches
+ * @return {number[][]}
+ */
 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);
+    const cnt = new Map();
+    for (const [a, b] of matches) {
+        cnt.set(a, cnt.has(a) ? cnt.get(a) : 0);
+        cnt.set(b, (cnt.get(b) || 0) + 1);
+    }
+    const ans = [[], []];
+    for (let [u, v] of cnt.entries()) {
+        if (v < 2) {
+            ans[v].push(u);
         }
     }
-
-    return [[...onlyWins].sort((a, b) => a - b), [...oneLose].sort((a, b) => a - b)];
+    ans[0].sort((a, b) => a - b);
+    ans[1].sort((a, b) => a - b);
+    return ans;
 };

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

@@ -0,0 +1,16 @@
+function findWinners(matches: number[][]): number[][] {
+    const cnt: Map<number, number> = new Map();
+    for (const [a, b] of matches) {
+        cnt.set(a, cnt.has(a) ? cnt.get(a) : 0);
+        cnt.set(b, (cnt.get(b) || 0) + 1);
+    }
+    const ans: number[][] = [[], []];
+    for (let [u, v] of cnt.entries()) {
+        if (v < 2) {
+            ans[v].push(u);
+        }
+    }
+    ans[0].sort((a, b) => a - b);
+    ans[1].sort((a, b) => a - b);
+    return ans;
+}