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

solution/0900-0999/0972.Equal Rational Numbers/README.md

@@ -12,7 +12,6 @@
 
 <ul>
 	<li><code>&lt;IntegerPart&gt;</code>&nbsp;
-
     <ul>
     	<li>例：&nbsp;<code>0</code>&nbsp;,<code>12</code>&nbsp;和&nbsp;<code>123</code>&nbsp;</li>
     </ul>
@@ -27,7 +26,6 @@
     	<li>例： <code>0.1(6)</code> ， <code>1.(9)</code>， <code>123.00(1212)</code></li>
     </ul>
     </li>
-
 </ul>
 
 <p>十进制展开的重复部分通常在一对圆括号内表示。例如：</p>

solution/0900-0999/0972.Equal Rational Numbers/README_EN.md

@@ -10,7 +10,6 @@
 
 <ul>
 	<li><code>&lt;IntegerPart&gt;</code>
-
     <ul>
     	<li>For example, <code>12</code>, <code>0</code>, and <code>123</code>.</li>
     </ul>
@@ -25,7 +24,6 @@
     	<li>For example, <code>0.1(6)</code>, <code>1.(9)</code>, <code>123.00(1212)</code>.</li>
     </ul>
     </li>
-
 </ul>
 
 <p>The repeating portion of a decimal expansion is conventionally denoted within a pair of round brackets. For example:</p>

solution/0900-0999/0982.Triples with Bitwise AND Equal To Zero/README.md

@@ -170,6 +170,29 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function countTriplets(nums: number[]): number {
+    const mx = Math.max(...nums);
+    const cnt: number[] = Array(mx + 1).fill(0);
+    for (const x of nums) {
+        for (const y of nums) {
+            cnt[x & y]++;
+        }
+    }
+    let ans = 0;
+    for (let xy = 0; xy <= mx; ++xy) {
+        for (const z of nums) {
+            if ((xy & z) === 0) {
+                ans += cnt[xy];
+            }
+        }
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0982.Triples with Bitwise AND Equal To Zero/README_EN.md

@@ -151,6 +151,29 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function countTriplets(nums: number[]): number {
+    const mx = Math.max(...nums);
+    const cnt: number[] = Array(mx + 1).fill(0);
+    for (const x of nums) {
+        for (const y of nums) {
+            cnt[x & y]++;
+        }
+    }
+    let ans = 0;
+    for (let xy = 0; xy <= mx; ++xy) {
+        for (const z of nums) {
+            if ((xy & z) === 0) {
+                ans += cnt[xy];
+            }
+        }
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0982.Triples with Bitwise AND Equal To Zero/Solution.ts

@@ -0,0 +1,18 @@
+function countTriplets(nums: number[]): number {
+    const mx = Math.max(...nums);
+    const cnt: number[] = Array(mx + 1).fill(0);
+    for (const x of nums) {
+        for (const y of nums) {
+            cnt[x & y]++;
+        }
+    }
+    let ans = 0;
+    for (let xy = 0; xy <= mx; ++xy) {
+        for (const z of nums) {
+            if ((xy & z) === 0) {
+                ans += cnt[xy];
+            }
+        }
+    }
+    return ans;
+}