feat: update solutions to lc problem: No.1005 (#946)

Author: thinkasany

solution/1000-1099/1005.Maximize Sum Of Array After K Negations/README.md

@@ -170,7 +170,7 @@ public:
 
 ### **Go**
 
-```cpp
+```go
 func largestSumAfterKNegations(nums []int, k int) (ans int) {
 	cnt := map[int]int{}
 	for _, x := range nums {
@@ -207,6 +207,39 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function largestSumAfterKNegations(nums: number[], k: number): number {
+    const cnt: Map<number, number> = new Map();
+    for (const x of nums) {
+        cnt.set(x, (cnt.get(x) || 0) + 1);
+    }
+    for (let x = -100; x < 0 && k > 0; ++x) {
+        if (cnt.get(x)! > 0) {
+            const m = Math.min(cnt.get(x) || 0, k);
+            cnt.set(x, (cnt.get(x) || 0) - m);
+            cnt.set(-x, (cnt.get(-x) || 0) + m);
+            k -= m;
+        }
+    }
+    if ((k & 1) === 1 && (cnt.get(0) || 0) === 0) {
+        for (let x = 1; x <= 100; ++x) {
+            if (cnt.get(x)! > 0) {
+                cnt.set(x, (cnt.get(x) || 0) - 1);
+                cnt.set(-x, (cnt.get(-x) || 0) + 1);
+                break;
+            }
+        }
+    }
+    let ans = 0;
+    for (const [key, value] of cnt.entries()) {
+        ans += key * value;
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1005.Maximize Sum Of Array After K Negations/README_EN.md

@@ -148,7 +148,7 @@ public:
 
 ### **Go**
 
-```cpp
+```go
 func largestSumAfterKNegations(nums []int, k int) (ans int) {
 	cnt := map[int]int{}
 	for _, x := range nums {
@@ -185,6 +185,39 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function largestSumAfterKNegations(nums: number[], k: number): number {
+    const cnt: Map<number, number> = new Map();
+    for (const x of nums) {
+        cnt.set(x, (cnt.get(x) || 0) + 1);
+    }
+    for (let x = -100; x < 0 && k > 0; ++x) {
+        if (cnt.get(x)! > 0) {
+            const m = Math.min(cnt.get(x) || 0, k);
+            cnt.set(x, (cnt.get(x) || 0) - m);
+            cnt.set(-x, (cnt.get(-x) || 0) + m);
+            k -= m;
+        }
+    }
+    if ((k & 1) === 1 && (cnt.get(0) || 0) === 0) {
+        for (let x = 1; x <= 100; ++x) {
+            if (cnt.get(x)! > 0) {
+                cnt.set(x, (cnt.get(x) || 0) - 1);
+                cnt.set(-x, (cnt.get(-x) || 0) + 1);
+                break;
+            }
+        }
+    }
+    let ans = 0;
+    for (const [key, value] of cnt.entries()) {
+        ans += key * value;
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1005.Maximize Sum Of Array After K Negations/Solution.ts

@@ -0,0 +1,28 @@
+function largestSumAfterKNegations(nums: number[], k: number): number {
+    const cnt: Map<number, number> = new Map();
+    for (const x of nums) {
+        cnt.set(x, (cnt.get(x) || 0) + 1);
+    }
+    for (let x = -100; x < 0 && k > 0; ++x) {
+        if (cnt.get(x)! > 0) {
+            const m = Math.min(cnt.get(x) || 0, k);
+            cnt.set(x, (cnt.get(x) || 0) - m);
+            cnt.set(-x, (cnt.get(-x) || 0) + m);
+            k -= m;
+        }
+    }
+    if ((k & 1) === 1 && (cnt.get(0) || 0) === 0) {
+        for (let x = 1; x <= 100; ++x) {
+            if (cnt.get(x)! > 0) {
+                cnt.set(x, (cnt.get(x) || 0) - 1);
+                cnt.set(-x, (cnt.get(-x) || 0) + 1);
+                break;
+            }
+        }
+    }
+    let ans = 0;
+    for (const [key, value] of cnt.entries()) {
+        ans += key * value;
+    }
+    return ans;
+}