feat: add solutions to lc problems: No.3180,3181 (doocs#3671)

* No.3180.Maximum Total Reward Using Operations I
* No.3181.Maximum Total Reward Using Operations II

Author: yanglbme

solution/3100-3199/3180.Maximum Total Reward Using Operations I/README.md

@@ -456,6 +456,21 @@ func maxTotalReward(rewardValues []int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function maxTotalReward(rewardValues: number[]): number {
+    rewardValues.sort((a, b) => a - b);
+    rewardValues = [...new Set(rewardValues)];
+    let f = 1n;
+    for (const x of rewardValues) {
+        const mask = (1n << BigInt(x)) - 1n;
+        f = f | ((f & mask) << BigInt(x));
+    }
+    return f.toString(2).length - 1;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3100-3199/3180.Maximum Total Reward Using Operations I/README_EN.md

@@ -454,6 +454,21 @@ func maxTotalReward(rewardValues []int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function maxTotalReward(rewardValues: number[]): number {
+    rewardValues.sort((a, b) => a - b);
+    rewardValues = [...new Set(rewardValues)];
+    let f = 1n;
+    for (const x of rewardValues) {
+        const mask = (1n << BigInt(x)) - 1n;
+        f = f | ((f & mask) << BigInt(x));
+    }
+    return f.toString(2).length - 1;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3100-3199/3180.Maximum Total Reward Using Operations I/Solution3.ts

@@ -0,0 +1,10 @@
+function maxTotalReward(rewardValues: number[]): number {
+    rewardValues.sort((a, b) => a - b);
+    rewardValues = [...new Set(rewardValues)];
+    let f = 1n;
+    for (const x of rewardValues) {
+        const mask = (1n << BigInt(x)) - 1n;
+        f = f | ((f & mask) << BigInt(x));
+    }
+    return f.toString(2).length - 1;
+}

solution/3100-3199/3181.Maximum Total Reward Using Operations II/README.md

@@ -167,6 +167,21 @@ func maxTotalReward(rewardValues []int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function maxTotalReward(rewardValues: number[]): number {
+    rewardValues.sort((a, b) => a - b);
+    rewardValues = [...new Set(rewardValues)];
+    let f = 1n;
+    for (const x of rewardValues) {
+        const mask = (1n << BigInt(x)) - 1n;
+        f = f | ((f & mask) << BigInt(x));
+    }
+    return f.toString(2).length - 1;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3100-3199/3181.Maximum Total Reward Using Operations II/README_EN.md

@@ -165,6 +165,21 @@ func maxTotalReward(rewardValues []int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function maxTotalReward(rewardValues: number[]): number {
+    rewardValues.sort((a, b) => a - b);
+    rewardValues = [...new Set(rewardValues)];
+    let f = 1n;
+    for (const x of rewardValues) {
+        const mask = (1n << BigInt(x)) - 1n;
+        f = f | ((f & mask) << BigInt(x));
+    }
+    return f.toString(2).length - 1;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3100-3199/3181.Maximum Total Reward Using Operations II/Solution.ts

@@ -0,0 +1,10 @@
+function maxTotalReward(rewardValues: number[]): number {
+    rewardValues.sort((a, b) => a - b);
+    rewardValues = [...new Set(rewardValues)];
+    let f = 1n;
+    for (const x of rewardValues) {
+        const mask = (1n << BigInt(x)) - 1n;
+        f = f | ((f & mask) << BigInt(x));
+    }
+    return f.toString(2).length - 1;
+}