feat: add ts solution to lc problem: No.1725

No.1725.Number Of Rectangles That Can Form The Largest Square

Author: zhaocchen

solution/1700-1799/1725.Number Of Rectangles That Can Form The Largest Square/README.md

@@ -88,6 +88,24 @@ class Solution {
 }
 ```
 
+### **TypeSript**
+
+```ts
+function countGoodRectangles(rectangles: number[][]): number {
+    let maxLen = 0, ans = 0;
+    for (let [l, w] of rectangles) {
+        let k = Math.min(l, w,);
+        if (k == maxLen) {
+            ans++;
+        } else if (k > maxLen) {
+            maxLen = k;
+            ans = 1;
+        }
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/1700-1799/1725.Number Of Rectangles That Can Form The Largest Square/README_EN.md

@@ -88,6 +88,24 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function countGoodRectangles(rectangles: number[][]): number {
+    let maxLen = 0, ans = 0;
+    for (let [l, w] of rectangles) {
+        let k = Math.min(l, w,);
+        if (k == maxLen) {
+            ans++;
+        } else if (k > maxLen) {
+            maxLen = k;
+            ans = 1;
+        }
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/1700-1799/1725.Number Of Rectangles That Can Form The Largest Square/Solution.ts

@@ -0,0 +1,13 @@
+function countGoodRectangles(rectangles: number[][]): number {
+    let maxLen = 0, ans = 0;
+    for (let [l, w] of rectangles) {
+        let k = Math.min(l, w,);
+        if (k == maxLen) {
+            ans++;
+        } else if (k > maxLen) {
+            maxLen = k;
+            ans = 1;
+        }
+    }
+    return ans;
+};